Computing strongly connected components in parallel on CUDA

Proceedings - 25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011

Volumn , Issue , 2011, Pages 544-555

  Barnat, Jiří ^a   Bauch, Petr ^a   Brim, Luboš ^a   Češka, Milan ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC COMPLEXITY; COMMERCIAL APPLICATIONS; DIRECTED GRAPHS; GRAPH PROBLEMS; STRONGLY CONNECTED COMPONENT;

DISTRIBUTED PARAMETER NETWORKS; OPTIMIZATION; PARALLEL ARCHITECTURES;

PARALLEL ALGORITHMS;

EID: 80053287330     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2011.59     Document Type: Conference Paper

References (25)

1. N. Amato. Improved Processor Bounds for Parallel Algorithms for Weighted Directed Graphs. Information Processing Letters, 45(3):147-152, 1993.
2. D. A. Bader and K. Madduri. Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors. In HiPC, volume 3769 of LNCS, pages 465-476. Springer, 2005.
3. D. A. Bader and K. Madduri. GTgraph: A Synthetic Graph Generator Suite. Technical Report GA 30332, Georgia Institute of Technology, Atlanta, 2006.
4. J. Barnat, P. Bauch, L. Brim, and M. Češka. Employing Multiple CUDA Devices to Accelerate LTL Model Checking. In 16th International Conference on Parallel and Distributed Systems (ICPADS 2010), pages 259-266. IEEE Computer Society, 2010.
5. J. Barnat, L. Brim, and P. Ročkai. Scalable Multi-core LTL Model-Checking. In SPIN '07: Model Checking Software, volume 4595 of LNCS, pages 187-203. Springer, 2007.
6. J. Barnat, L. Brim, and I. Černá. Cluster-Based LTL Model Checking of Large Systems. In FMCO, volume 4111 of LNCS, pages 259-279. Springer, 2005.
7. J. Barnat, L. Brim, L. Černá, P. Moravec, P. Ročkai, and P. Šimeček. DiVinE - A Tool for Distributed Verification (Tool Paper). In CAV '06: Computer Aided Verification, volume 4144/2006 of LNCS, pages 278-281. Springer, 2006.
8. J. Barnat, J. Chaloupka, and J. C. van de Pol. Improved Distributed Algorithms for SCC Decomposition. In PDMC, pages 65-80. CTIT, University of Twente, 2007.
9. J. Barnat, J. Chaloupka, and J. C. van de Pol. Distributed Algorithms for SCC Decomposition. To appear in Journal of Logic and Computation, 2010.
10. J. Barnat and P. Moravec. Parallel Algorithms for Finding SCCs in Implicitly Given Graphs. In Formal Methods: Applications and Technology, volume 4346 of LNCS, pages 316-330. Springer, 2006. (Pubitemid 350143531)
11. G. E. Blelloch. Vector Models for Data-Parallel Computing. MIT Press, Cambridge, MA, USA, 1990.
12. Boost: C++ libraries. http://www.boost.org/, September 2010.
13. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A Recursive Model for Graph Mining. In SDM, pages 442-446. SIAM, 2004.
14. R. Cole and U. Vishkin. Faster Optimal Parallel Prefix Sums and List Ranking. Information and Computation, 81(3):334-352, 1989.
15. NVIDIA CUDA Compute Unified Device Architecture - Programming Guide Version 3.1, http://developer.nvidia.com/object/cuda-3-1-downloads.html, September 2010.
16. L. K. Fisler, R. Fraer, G. Kamhi, M. Y. Vardi, and Z. Yang. Is There a Best Symbolic Cycle-Detection Algorithm? In TACAS, volume 2031 of LNCS, pages 420-434. Springer, 2001. (Pubitemid 33254674)
17. L. K. Fleischer, B. Hendrickson, and A. Pinar. On Identifying Strongly Connected Components in Parallel. In Parallel and Distributed Processing, volume 1800 of LNCS, pages 505-511. Springer, 2000.
18. H. Gazit and G. L. Miller. An Improved Parallel Algorithm That Computes the BFS Numbering of a Directed Graph. Information Processing Letters, 28(2):61-65, 1988. (Pubitemid 18649084)
19. P. Harish and P. J. Narayanan. Accelerating Large Graph Algorithms on the GPU Using CUDA. In HiPC, volume 4873 of LNCS, pages 197-208. Springer, 2007.
20. P. Harish, V. Vineet, and P. J. Narayanan. Large Graph Algorithms for Massively Multithreaded Architectures. Technical Report IIIT/TR/2009/74, Center for Visual Information Technology, International Institute of Information Technology Hyderabad, INDIA, 2009.
21. W. McLendon III, B. Hendrickson, S. J. Plimpton, and L. Rauchwerger. Finding Strongly Connected Components in Distributed Graphs. Journal of Parallel and Distributed Computing, 65(8):901-910, 2005. (Pubitemid 40821906)
22. S. Orzan. On Distributed Verification and Verified Distribution. PhD thesis, Free University of Amsterdam, 2004.
23. J. H. Reif. Depth-First Search is Inherrently Sequential. Information Processing Letters, 20(5):229-234, 1985.
24. R. Tarjan. Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing, 1(2):146-160, 1972.
25. S. Warren. Finding Strongly Connected Components in Parallel Using O(log2n) Reachability Queries. In SPAA, pages 146-151. ACM, 2008.