A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations
- 24 October 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 531-538
- https://doi.org/10.1109/icpp.2006.9
Abstract
This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a parallel version of the sorting-based external-memory frontier breadth-first traversal with delayed duplicate detection algorithm. The algorithm distributes the workload according to intervals that are computed at runtime via a sampling-based process. We present an experimental evaluation of the algorithm where we compare its performance to that of its sequential counterpart on the implicit graphs of two classic planning problems. The speedups attained by the algorithm over its sequential counterpart are consistently near linear and frequently above linear. Analysis reveals that the algorithm is proficient at distributing the workload and that increasing the number of samples obtained by the sampling-based process improves workload distribution. Analysis also reveals that the algorithm benefits from the caching of external memory in internal memory that is done by the operating systemKeywords
This publication has 9 references indexed in Scilit:
- Breadth-first heuristic searchArtificial Intelligence, 2006
- Additive Pattern Database HeuristicsJournal of Artificial Intelligence Research, 2004
- The architectural costs of streaming I/O: A comparison of workstations, clusters, and SMPsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Memory management during run generation in external sortingPublished by Association for Computing Machinery (ACM) ,1998
- High-performance sorting on networks of workstationsPublished by Association for Computing Machinery (ACM) ,1997
- Speeding up external mergesortIEEE Transactions on Knowledge and Data Engineering, 1996
- Algorithms for parallel memory, I: Two-level memoriesAlgorithmica, 1994
- Parallel sorting by regular samplingJournal of Parallel and Distributed Computing, 1992
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968