Ordered and unordered algorithms for parallel breadth first search
Proceedings of the 19th international conference on Parallel architectures …, 2010•dl.acm.org
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.
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.
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.
ACM Digital LibraryShowing the best result for this search. See all results