GitHub - bondhugula/fw_fpga: An FPGA accelerator for all-pairs shortest-paths (using the Floyd-Warshall algorithm)

fw.v is the top-level module.
For more details on the FPGA design, please see:
1. Parallel FPGA-based All-Pairs Shortest-Paths in a Directed Graph Uday Bondhugula, Ananth Devulapalli, Joseph Fernando, Pete Wyckoff, and P. Sadayappan. 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS '06), Apr 2006, Rodos, Greece. https://ieeexplore.ieee.org/abstract/document/1639347/
2. Code comments.
The testbench/ directory contains the testbench for the hardware design.
The C/ directory has the CPU reference code, and a 'make' in that directory will generate binaries for 8x8, 16x16 and 32x32 matrix sizes, that when run on the CPU, will emit input and outputs that can be used to verify the FPGA designs for B = 8, 16, 32 (number of PEs) respectively.
Contact: Email: [email protected], [email protected]

Name		Name	Last commit message	Last commit date
Latest commit History 11 Commits
C		C
testbench		testbench
.gitignore		.gitignore
AUTHORS		AUTHORS
LICENSE		LICENSE
README.md		README.md
clock.v		clock.v
fw.v		fw.v
fw_control.v		fw_control.v
fw_dummy.v		fw_dummy.v
local_store.v		local_store.v
op.v		op.v
params.v		params.v
pe.v		pe.v
pe_instr_decoder.v		pe_instr_decoder.v
pivot_ram.v		pivot_ram.v

Provide feedback