A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2010, Pages 303-314

  Leiserson, Charles E ^a   Schardl, Tao B ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Breadth first search; Cilk; Graph algorithms; Hyperobjects; Multithreading; Nondeterminism; Parallel algorithms; Reducers; Workstealing

Indexed keywords

BREADTH-FIRST SEARCH; GRAPH ALGORITHMS; HYPEROBJECTS; MULTI-THREADING; NON-DETERMINISM;

DATA STRUCTURES; LEARNING ALGORITHMS; MULTITASKING; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; PROGRAM PROCESSORS;

GRAPH THEORY;

EID: 77954929696     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810479.1810534     Document Type: Conference Paper

References (32)

1. N. S. Arora, R. D. Blumofe, and C. G. Plaxton. Thread scheduling for multiprogrammed multiprocessors. In SPAA, pp. 119-129, 1998.
2. D. Bader, J. Feo, J. Gilbert, J. Kepner, D. Keoster, E. Loh, K. Madduri, B. Mann, and T. Meuse. HPCS scalable synthetic compact applications #2, 2007. Available at http://www.graphanalysis.org/benchmark/HPCS-SSCA2-Graph-Theory-v2. 2.doc.
3. D. A. Bader and K. Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In ICPP, pp. 523-530, 2006.
4. G. E. Blelloch. Programming parallel algorithms. CACM, 39(3), 1996.
5. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. JPDC, 37(1):55-69, 1996.
6. R. D. Blumofe and C. E. Leiserson. Space-efficient scheduling of multithreaded computations. SIAM J. on Comput., 27(1):202-229, 1998.
7. R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. JACM, 46(5):720-748, 1999.
8. R. P. Brent. The parallel evaluation of general arithmetic expressions. JACM, 21(2):201-206, 1974.
9. G. Cong, S. Kodali, S. Krishnamoorthy, D. Lea, V. Saraswat, and T. Wen. Solving large, irregular graph problems using adaptive work-stealing. In ICPP, pp. 536-545, 2008.
10. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, third edition, 2009.
11. T. A. Davis. University of Florida sparse matrix collection, 2010. Available at http://www.cise.ufl.edu/research/sparse/matrices/.
12. D. L. Dill, A. J. Drexler, A. J. Hu, and C. H. Yang. Protocol verification as a hardware design aid. In ICCD, pp. 522-525, 1992.
13. D. L. Eager, J. Zahorjan, and E. D. Lazowska. Speedup versus efficiency in parallel systems. IEEE Trans. Comput., 38(3):408-423, 1989.
14. M. Frigo, P. Halpern, C. E. Leiserson, and S. Lewin-Berlin. Reducers and other Cilk++ hyperobjects. In SPAA, pp. 79-90, 2009.
15. M. Frigo, C. E. Leiserson, and K. H. Randall. The implementation of the Cilk-5 multithreaded language. In PLDI, pp. 212-223, 1998.
16. J. R. Gilbert, G. L. Miller, and S.-H. Teng. Geometric mesh partitioning: Implementation and experiments. SIAM J. on Sci. Comput., 19(6):2091-2110, 1998.
17. R. L. Graham. Bounds for certain multiprocessing anomalies. Bell Sys. Tech. J., 45:1563-1581, 1966.
18. Y. He. Multicore-enabling the Murphi verification tool. Available from http://software.intel.com/en-us/article/multicore-enabling-the-murphi- verfication-tool/, 2009.
19. Y. He, C. E. Leiserson, and W. M. Leiserson. The Cilkview scalability analyzer. In SPAA, 2010.
20. Intel Corporation. Intel Cilk++ SDK Programmer's Guide, 2009. Document Number: 322581-001US.
21. R. E. Korf and P. Schultze. Large-scale parallel breadth-first search. In AAA, pp. 1380-1385, 2005.
22. C. Y. Lee. An algorithm for path connection and its applications. IRE Trans. on Elec. Comput., EC-10(3):346-365, 1961.
23. C. E. Leiserson. The Cilk++ concurrency platform. J. Supercomput., 51(3):244-257, 2010.
24. J. Leskovec, D. Chakrabarti, J. M. Kleinberg, and C. Faloutsos. Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication. In PKDD, pp. 133-145, 2005.
25. J. B. Lubos, L. Brim, and J. Chaloupka. Parallel breadth-first search LTL model-checking. In ASE, pp. 106-115, 2003.
26. E. F. Moore. The shortest path through a maze. In Int. Symp. on Th. of Switching, pp. 285-292, 1959.
27. D. Stein and D. Shah. Implementing lightweight threads. In USENIX, pp. 1-9, 1992.
28. B. Stroustrup. The C++ Programming Language. Addison-Wesley, third edition, 2000.
29. Supertech Research Group, MIT/LCS. Cilk 5.4.6 Reference Manual, 1998. Available from http://supertech.csail.mit.edu/cilk/.
30. A. van Heukelum, G. T. Barkema, and R. H. Bisseling. Dna electrophoresis studied with the cage model. J. Comput. Phys., 180(1):313-326, 2002.
31. A. Yoo, E. Chow, K. Henderson, W. McLendon, B. Hendrickson, and U. Catalyurek. A scalable distributed parallel breadth-first search algorithm on BlueGene/L. In SC '05, p. 25, 2005.
32. Y. Zhang and E. A. Hansen. Parallel breadth-first heuristic search on a shared-memory architecture. In AAAI Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications, 2006.