Coder Social home page Coder Social logo

approximate-pagerank-public's Introduction

Alberto Parravicini, Francesco Sgherzi

Board used: Alveo U200, FPGA: xcu200-fsgd2104-2-e

Software Version: Xilinx Vivado HLS 2018.3, Xilinx SDx 2018.3

Instructions to build and test project:

  • The file src/fpga/src/csc_fpga/csc_fpga.hpp contains different useful settings. Default values will be ok to test the project, but you can play with them if desired
    • FIXED_WIDTH: bit-width of fixed-point values, including 1 bit of integer part
    • N_PPR_VERTICES: number of vertices for which PPR is computed in parallel
    • AP_UINT_BITWIDTH: how many COO values (i.e. graph edges) are processed for each clock cycle
    • MAX_VERTICES: maximum number of vertices supported by the graph. The default value (2^14) is small to allow faster build time, and is enough to use the small graphs included in the repository
  • To build the project from scratch, and run it on FPGA, perform the following steps
    • make build TARGET=hw. This will start the compilation and bitstream generation. The TARGET_CLOCK setting in the Makefile allows to specify the desired clock frequency. Whether this value can be achieved depends on the specified bitwidth and other settings, although SDx will try building the project with the highest clock frequency it can.
    • make host TARGET=hw. Optional step, it rebuilds the host code. It might be required if the machine where the build step was performed has a different CPU architecture than the machine where the compiled host code is executed. If you get errors such as HAL version 1 not supported when executing the code, you need to rebuild the host code
  • The project was tested on an Alveo U200 board with DSA xilinx_u200_xdma_201830_2. Remember to source the FPGA setup.sh on the machine where the code is executed!
  • Running the code:
    • cd repository/build/hw/xilinx_u200_xdma_201830_2
    • ./approximate_pagerank -d -g <path/to/graph.mtx> -m 100 -t 10 -x <path/to/xclbin>
    • -d: if present, print debug information
    • -s: if present, use a small sample graph
    • -m: max number of iterations
    • -e: error value used as convergence threshold
    • -a: value of alpha
    • -t: number of times the computation is repeated, for testing
    • -p: personalization vertex ID. If not present, use N_PPR_VERTICES random values for testing

approximate-pagerank-public's People

Contributors

albertoparravicini avatar

Watchers

 avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.