Parallel graph analytics
Authors:
Open Access
- 26 April 2016
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 59 (5) , 78-87
Abstract
Data-centric abstractions and execution strategies are needed to exploit parallelism in large-scale graph analytics.Keywords
This publication has 27 references indexed in Scilit:
- Synthesizing parallel graph programs via automated planningACM SIGPLAN Notices, 2015
- Synthesizing parallel graph programs via automated planning2015
- CuSha2014
- Scalable GPU graph traversalACM SIGPLAN Notices, 2012
- The Combinatorial BLAS: design, implementation, and applicationsThe International Journal of High Performance Computing Applications, 2011
- Accelerating Large Graph Algorithms on the GPU Using CUDA2008
- Design of Multithreaded Algorithms for Combinatorial Problems2007
- The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelizationIEEE Transactions on Parallel and Distributed Systems, 1999
- Δ-Stepping : A Parallel Single Source Shortest Path Algorithm1998
- A bridging model for parallel computationCommunications of the ACM, 1990