Parallel Asynchronous Label Correcting Methods for Shortest Paths 1

@inproceedings{Bertsekas1996ParallelAL,
  title={Parallel Asynchronous Label Correcting Methods for Shortest Paths 1},
  author={P. Bertsekas and Francesca Guerriero and Roberto Musmanno},
  year={1996}
}
In this paper we develop parallel asynchronous implementations of some known and some new label correcting methods for finding a shortest path from a single origin to all the other nodes of a directed graph. We compare these implementations on a shared memory multiprocessor, the Alliant FX/80, using several types of randomly generated problems. Excellent (sometimes superlinear) speedup is achieved with some of the methods, and it is found that the asynchronous versions of these methods are… CONTINUE READING
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 68 citations. REVIEW CITATIONS

11 Figures & Tables

Topics

Statistics

0510'96'98'00'02'04'06'08'10'12'14'16'18
Citations per Year

69 Citations

Semantic Scholar estimates that this publication has 69 citations based on the available data.

See our FAQ for additional information.