A Reconfigurable Computing Approach for Efficient and Scalable Parallel Graph Exploration

@article{Betkaoui2012ARC,
  title={A Reconfigurable Computing Approach for Efficient and Scalable Parallel Graph Exploration},
  author={Brahim Betkaoui and Y. Wang and David B. Thomas and W. Luk},
  journal={2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors},
  year={2012},
  pages={8-15}
}
  • Brahim Betkaoui, Y. Wang, +1 author W. Luk
  • Published 2012
  • Computer Science
  • 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors
In many application domains, data are represented using large graphs involving millions of vertices and billions of edges. Graph exploration algorithms, such as breadth-first search (BFS), are largely dominated by memory latency and are challenging to process efficiently. In this paper, we present a reconfigurable hardware methodology for efficient parallel processing of large-scale graph exploration problems. Our methodology is based on a reconfigurable hardware architecture which decouples… Expand
Accelerating Large-Scale Single-Source Shortest Path on FPGA
High-Throughput and Energy-Efficient Graph Processing on FPGA
CyGraph: A Reconfigurable Architecture for Parallel Breadth-First Search
FPGP: Graph Processing Framework on FPGA A Case Study of Breadth-First Search
Hybrid breadth-first search on a single-chip FPGA-CPU heterogeneous platform
An FPGA framework for edge-centric graph processing
GraVF-M: Graph Processing System Generation for Multi-FPGA Platforms
IP Cores for Graph Kernels on FPGAs
A Template-Based Design Methodology for Graph-Parallel Hardware Accelerators
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
Efficient Parallel Graph Exploration on Multi-Core CPU and GPU
HAGAR: Efficient Multi-context Graph Processors
GraphStep: A System Architecture for Sparse-Graph Algorithms
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
A message-passing multi-softcore architecture on FPGA for Breadth-first Search
Efficient Breadth-First Search on the Cell/BE Processor
Scalable Graph Exploration on Multicore Processors
Solving graph problems with dynamic computation structures
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
TOPOLOGICALLY ADAPTIVE PARALLEL BREADTH-FIRST SEARCH ON MULTICORE PROCESSORS
...
1
2
3
...