Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

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

Summary: A Parallel External-Memory Frontier Breadth-First
Traversal Algorithm for Clusters of Workstations
Robert Niewiadomski, Jos┤e Nelson Amaral, Robert C. Holte
Department of Computing Science
University of Alberta
Edmonton, Alberta, T6G 2E8, Canada
Email: {niewiado,amaral,holte}@cs.ualberta.ca
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

  

Source: Amaral, JosÚ Nelson - Department of Computing Science, University of Alberta
Holte, Robert - Department of Computing Science, University of Alberta

 

Collections: Computer Technologies and Information Sciences