Parallel asynchronous label-correcting methods for shortest paths

D. P. Bertsekas, F. Guerriero, R. Musmanno

Research output: Contribution to journalArticlepeer-review

43 Scopus citations


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 substantially faster than their synchronous counterparts.

Original languageEnglish (US)
Pages (from-to)297-320
Number of pages24
JournalJournal of Optimization Theory and Applications
Issue number2
StatePublished - Feb 1996
Externally publishedYes


  • Label-correcting methods
  • Parallel asynchronous algorithms
  • Shared memory multiprocessors
  • Shortest path problems

ASJC Scopus subject areas

  • Control and Optimization
  • Applied Mathematics
  • Management Science and Operations Research


Dive into the research topics of 'Parallel asynchronous label-correcting methods for shortest paths'. Together they form a unique fingerprint.

Cite this