Efficient decomposition of strongly connected components on GPUs
- 1 January 2014
- journal article
- Published by Elsevier BV in Journal of Systems Architecture
- Vol. 60 (1), 1-10
- https://doi.org/10.1016/j.sysarc.2013.10.014
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Scalable GPU graph traversalPublished by Association for Computing Machinery (ACM) ,2012
- Computing Strongly Connected Components in Parallel on CUDAPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Accelerating CUDA graph algorithms at maximum warpPublished by Association for Computing Machinery (ACM) ,2011
- An effective GPU implementation of breadth-first searchPublished by Association for Computing Machinery (ACM) ,2010
- Distributed Algorithms for SCC DecompositionJournal of Logic and Computation, 2009
- Accelerating Large Graph Algorithms on the GPU Using CUDAPublished by Springer Science and Business Media LLC ,2008
- Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric MultiprocessorsLecture Notes in Computer Science, 2005
- R-MAT: A Recursive Model for Graph MiningPublished by Society for Industrial & Applied Mathematics (SIAM) ,2004
- Depth-first search is inherently sequentialInformation Processing Letters, 1985
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972