Seminar: Graph Processing using FPGAs
Contents
Accelerating Large-Scale Single-Source Shortest Path
Bellman-Ford Algorithm
Single-Source Shortest Path (SSSP)
Maximises data parallelism
Efficient data forwarding scheme to handle data hazards in the pipelined architecture
Higher parallelism = higher resource utilisation
Higher graph size = lower clock rate
High-throughput and Energy-efficient Graph Processing
- Optimise the data layout for an edge-centric design
Edge-Centric Graph Processing
- Scatter phase - Message is broadcasted to find the destination
- Gather phase - Update node value