The Community for Technology Leaders
2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT) (2010)
Vienna, Austria
Sept. 11, 2010 to Sept. 15, 2010
ISBN: 978-1-5090-5032-1
pp: 539-540
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
ABSTRACT
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.
INDEX TERMS
Galois system, Parallel Breadth First Search, Multicore processors, Amorphous data-parallelism
CITATION
M. Amber Hassaan, Martin Burtscher, Keshav Pingali, "Ordered and unordered algorithms for parallel breadth first search", 2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT), vol. 00, no. , pp. 539-540, 2010, doi:
90 ms
(Ver 3.3 (11022016))