A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures

Mayiz B. Habbal, Haris N. Koutsopoulos and Steven R. Lerman
Additional contact information
Mayiz B. Habbal: GTE Laboratories, Inc., Waltham, Massachusetts
Haris N. Koutsopoulos: Carnegie-Mellon University, Pittsburgh, Pennsylvania
Steven R. Lerman: Massachusetts Institute of Technology, Cambridge, Massachusetts

Transportation Science, 1994, vol. 28, issue 4, 292-308

Abstract: Network optimization on parallel computer architectures has attracted significant interest in recent years. In this paper, we examine the solution of the shortest path problem on massively parallel architectures. We propose a network decomposition strategy that is amenable to parallel implementation and suggest efficient data structures and mappings of the data to the processors that facilitate the solution of the problem. We discuss computational results for the solution of networks of various sizes on the Connection Machine CM-2 (a representative massively parallel architecture) and compare the performance of the algorithm to the performance of serial algorithms implemented on the CRAY X-MP supercomputer and VAXstation 3100. We also present an “idealized” analysis of the algorithm and draw conclusions on properties of decomposition strategies that optimize its performance.

Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.28.4.292 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:28:y:1994:i:4:p:292-308

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().