2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT) (2010)
Sept. 11, 2010 to Sept. 15, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/
M. Amber Hassaan , Department of Electrical and Computer Engineering, University of Texas at Austin, USA
Martin Burtscher , Institute for Computational Engineering and Sciences, University of Texas at Austin, USA
Keshav Pingali , Department of Computer Science, University of Texas at Austin, USA
We describe and evaluate ordered and unordered algorithms for shared-memory parallel breadth-first search. The unordered algorithm is based on viewing breadth-first search as a fixpoint computation, and in general, it may perform more work than the ordered algorithms while requiring less global synchronization.
Galois system, Parallel Breadth First Search, Multicore processors, Amorphous data-parallelism
M. A. Hassaan, M. Burtscher and K. Pingali, "Ordered and unordered algorithms for parallel breadth first search," 2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT), Vienna, Austria, 2010, pp. 539-540.