CHALLENGES IN PARALLEL GRAPH PROCESSING
Andrew Lumsdaine, Douglas Gregor, Bruce Hendrickson et al. · Parallel Processing Letters · 2007
Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel computing resources are required to meet their computational and memory requirements. Unfortunately, the algorithms, software, and hardware that have worked well for developing mainstream parallel scientific applications are not necessarily effective for large-scale graph problems. In this paper we present the inter-relationships between graph problems, software, and parallel hardware in the current state of the art and discuss how those issues present inherent challenges in solving large-scale graph problems. The range of these challenges suggests a research agenda for the development of scalable high-performance software for graph problems.
Cited by 469 works. doi:10.1142/s0129626407002843
Authors
References
- A Bridging Model for Parallel Computation
- OpenMP: an industry standard API for shared-memory programming
- Open MPI: Goals, Concept, and Design of a Next Generation MPI Implementation
- An introduction to parallel algorithms
- MPI - The Complete Reference
- TreadMarks: shared memory computing on networks of workstations
- Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
- A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
- MPI: The Complete Reference , Vol. 2 - The MPI-2 Extensions
- Parallel shortest path algorithms for solving large-scale instances