Sciweavers

Share
ICPP
2006
IEEE

A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations

9 years 2 months ago
A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations
— 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 breadthfirst 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...
Robert Niewiadomski, José Nelson Amaral, Ro
Added 11 Jun 2010
Updated 11 Jun 2010
Type Conference
Year 2006
Where ICPP
Authors Robert Niewiadomski, José Nelson Amaral, Robert C. Holte
Comments (0)
books