๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the 22nd ACM symposium - Thira, Santorini, Greece (2010.06.13-2010.06.15)] Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10 - A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)

โœ Scribed by Leiserson, Charles E.; Schardl, Tao B.

Book ID
121257226
Publisher
ACM Press
Year
2010
Weight
830 KB
Category
Article
ISBN
1450300790

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[ACM Press the 22nd ACM symposium - Thir
[ACM Press the 22nd ACM symposium - Thira, Santorini, Greece (2010.06.13-2010.06.15)] Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10 - A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)
โœ Leiserson, Charles E.; Schardl, Tao B. ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› ACM Press ๐ŸŒ English โš– 830 KB

We have developed a multithreaded implementation of breadth-first search (BFS) of a sparse graph using the Cilk++ extensions to C++. Our PBFS program on a single processor runs as quickly as a standard C++ breadth-first search implementation. PBFS achieves high work-efficiency by using a novel imple