poster

Ordered and unordered algorithms for parallel breadth first search

Authors:

M. Amber Hassaan,

Martin Burtscher,

Keshav PingaliAuthors Info & Claims

PACT '10: Proceedings of the 19th international conference on Parallel architectures and compilation techniques

Pages 539 - 540

https://doi.org/10.1145/1854273.1854341

Published: 11 September 2010 Publication History

Get Access

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.

References

[1]

}}David A. Bader and Kamesh Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the cray mta-2. In ICPP '06: Proceedings of the 2006 International Conference on Parallel Processing, pages 523--530, Washington, DC, USA, 2006. IEEE Computer Society.

Digital Library

Google Scholar

[2]

}}Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein, editors. Introduction to Algorithms. MIT Press, 2001.

Digital Library

Google Scholar

[3]

}}M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, and L. P. Chew. Optimistic parallelism requires abstractions. SIGPLAN Not. (Proceedings of PLDI 2007), 42(6):211--222, 2007.

Digital Library

Google Scholar

[4]

}}Milind Kulkarni, Martin Burtscher, Rajasekhar Inkulu, Keshav Pingali, and Calin Casçaval. How much parallelism is there in irregular applications? In PPoPP, pages 3--14, 2009.

Digital Library

Google Scholar

[5]

}}Charles E. Leiserson and Tao B. Schardl. A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). In SPAA, pages 303--314, 2010.

Digital Library

Google Scholar

[6]

}}C. D. Polychronopoulos and D. J. Kuck. Guided self-scheduling: A practical scheduling scheme for parallel supercomputers. IEEE Trans. Comput., 36(12):1425--1439, 1987.

Digital Library

Google Scholar

[7]

}}Yang Zhang and Eric A. Hansen. Parallel breadth-first heuristic search on a shared memory architecture. In AAAI-06 Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications, July 2006.

Google Scholar

Cited By

View all

Gonzaga de Oliveira SSantana MBrandão DOsthoff C(2024)An OpenMP‐based breadth‐first search implementation using the bag data structureConcurrency and Computation: Practice and Experience10.1002/cpe.811936:16Online publication date: 31-May-2024
https://doi.org/10.1002/cpe.8119
Harshvardhan Fidel AAmato NRauchwerger L(2015)An Algorithmic Approach to Communication Reduction in Parallel Graph AlgorithmsProceedings of the 2015 International Conference on Parallel Architecture and Compilation (PACT)10.1109/PACT.2015.34(201-212)Online publication date: 18-Oct-2015
https://dl.acm.org/doi/10.1109/PACT.2015.34
Harshvardhan West BFidel AAmato NRauchwerger L(2015)A Hybrid Approach to Processing Big Data Graphs on Memory-Restricted SystemsProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2015.28(799-808)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPS.2015.28
Show More Cited By

Index Terms

Ordered and unordered algorithms for parallel breadth first search
1. Computing methodologies
  1. Parallel computing methodologies
    1. Parallel programming languages
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Frameworks
      2. Language types
        Parallel programming languages

Recommendations

Parallel breadth-first search on distributed memory systems
SC '11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis

Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to to be quite challenging to implement on distributed memory systems. In this work, we explore the design space of parallel algorithms for Breadth-...
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)
SPAA '10: Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures

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 standar. C++ breadth-first search implementation. PBFS ...
Ordered vs. unordered: a comparison of parallelism and work-efficiency in irregular algorithms
PPoPP '11: Proceedings of the 16th ACM symposium on Principles and practice of parallel programming

Outside of computational science, most problems are formulated in terms of irregular data structures such as graphs, trees and sets. Unfortunately, we understand relatively little about the structure of parallelism and locality in irregular algorithms. ...

Comments

Information & Contributors

Information

Published In

PACT '10: Proceedings of the 19th international conference on Parallel architectures and compilation techniques

September 2010

596 pages

ISBN:9781450301787

DOI:10.1145/1854273

General Chair:
Valentina Salapura
IBM TJ Watson Research Center
,
Program Chairs:
Michael Gschwind
IBM Systems & Technology Group
,
Jens Knoop
Technische Universität Wien

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 September 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

PACT '10

Sponsor:

IFIP WG 10.3
IEEE CS TCPP
SIGARCH
IEEE CS TCAA

PACT '10: International Conference on Parallel Architectures and Compilation Techniques

September 11 - 15, 2010

Vienna, Austria

Acceptance Rates

Overall Acceptance Rate 121 of 471 submissions, 26%

Upcoming Conference

PACT '24

Sponsor:
sigarch

International Conference on Parallel Architectures and Compilation Techniques

October 13 - 16, 2024

Long Beach , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
322
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)2

Reflects downloads up to 11 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gonzaga de Oliveira SSantana MBrandão DOsthoff C(2024)An OpenMP‐based breadth‐first search implementation using the bag data structureConcurrency and Computation: Practice and Experience10.1002/cpe.811936:16Online publication date: 31-May-2024
https://doi.org/10.1002/cpe.8119
Harshvardhan Fidel AAmato NRauchwerger L(2015)An Algorithmic Approach to Communication Reduction in Parallel Graph AlgorithmsProceedings of the 2015 International Conference on Parallel Architecture and Compilation (PACT)10.1109/PACT.2015.34(201-212)Online publication date: 18-Oct-2015
https://dl.acm.org/doi/10.1109/PACT.2015.34
Harshvardhan West BFidel AAmato NRauchwerger L(2015)A Hybrid Approach to Processing Big Data Graphs on Memory-Restricted SystemsProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2015.28(799-808)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPS.2015.28
Harshvardhan Fidel AAmato NRauchwerger LAmaral JTorrellas J(2014)KLAProceedings of the 23rd international conference on Parallel architectures and compilation10.1145/2628071.2628091(27-38)Online publication date: 24-Aug-2014
https://dl.acm.org/doi/10.1145/2628071.2628091
Suettlerlein JZuckerman SGao G(2013)An implementation of the codelet modelProceedings of the 19th international conference on Parallel Processing10.1007/978-3-642-40047-6_63(633-644)Online publication date: 26-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-642-40047-6_63

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Parallel breadth-first search on distributed memory systems

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

Ordered vs. unordered: a comparison of parallelism and work-efficiency in irregular algorithms