Title :
Single source shortest path problem on processor arrays
Author_Institution :
Center for Autom. Res., Maryland Univ., College Park, MD, USA
Abstract :
Algorithms for computing the shortest paths to every vertex from a single source vertex in nonnegatively weighted graphs are examined. A conventional data parallel algorithm and a replicated data algorithm for the single-source shortest path problem are presented. Both algorithms have been implemented on a Connection Machine CM-2 and a MasPar MP-1. Analytical and experimental speedups using the data replication technique are presented
Keywords :
graph theory; parallel algorithms; Connection Machine CM-2; MP-1; MasPar; data parallel algorithm; nonnegatively weighted graphs; processor arrays; replicated data algorithm; shortest path problem; single source vertex; Automation; Cities and towns; Costs; Data structures; Filtering; Histograms; Image processing; Parallel processing; Shortest path problem; Streaming media;
Conference_Titel :
Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the
Conference_Location :
McLean, VA
Print_ISBN :
0-8186-2772-7
DOI :
10.1109/FMPC.1992.234924
