Solving large, irregular graph problems using adaptive work-stealing

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2008, Pages 536-545

  Cong, Guojing ^a   Kodali, Sreedhar ^a   Krishnamoorthy, Sriram ^b   Lea, Doug ^c   Saraswat, Vijay ^a   Wen, Tong ^a  

^a IBM   (United States)

^b Ohio State ^*

^c STATE UNIVERSITY OF NEW YORK AT OSWEGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; GRAPH THEORY; JAVA PROGRAMMING LANGUAGE; PROBLEM ORIENTED LANGUAGES; TREES (MATHEMATICS);

CURRENT SOFTWARES; GRAPH ALGORITHMS; GRAPH PROBLEMS; MULTI-PROCESSORS; PARALLEL PROGRAMMING LANGUAGES; PARALLEL TASKS; SPANNING TREE ALGORITHMS; TERMINATION DETECTIONS; WORK STEALING;

PARALLEL PROGRAMMING;

EID: 55849100059     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2008.88     Document Type: Conference Paper

References (10)

1. D. A. Bader and G. Cong. A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). In Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), Santa Fe, New Mexico, Apr 2004.
2. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: an efficient multithreaded runtime system. In PPOPP '95: Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 207-216, New York, NY, USA, 1995. ACM.
3. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In Proc. 4th SIAM Intl. Conf. on Data Mining, April 2004.
4. M. Frigo, C. E. Leiserson, and K. H. Randall. The implementation of the cilk-5 multithreaded language. In SIGPLAN Conference on Programming Language Design and Implementation, pages 212-223, 1998.
5. J. Greiner. A comparison of data-parallel algorithms for connected components. In Proc. 6th Ann. Symp. Parallel Algorithms and Architectures (SPAA-94), pages 16-25, Cape May, NJ, June 1994.
6. D. Hendler and N. Shavit. Non-blocking steal-half work queues. InPODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing, pages 280-289, New York, NY, USA, 2002. ACM.
7. T.-S. Hsu, V. Ramachandran, and N. Dean. Parallel implementa-tion of algorithms for finding connected components in graphs. In S. N. Bhatt, editor, Parallel Algorithms: 3rd DIMACS Implementation Challenge October 17-19, 1994, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 23-41, 1997.
8. P. Klein and J. Reif. An efficient parallel algorithm for planarity. J. Comput. Syst. Sei., 37(2): 190-246, 1988.
9. G. L. Miller and V. Ramachandran. Efficient parallel ear decomposition with applications. Manuscript, UC Berkeley, MSRI, Jan. 1986.
10. V. A. Saraswat. X10 Language Report. Technical report, 2004.