Abstract
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 language | English (US) |
|---|---|
| Pages (from-to) | 297-320 |
| Number of pages | 24 |
| Journal | Journal of Optimization Theory and Applications |
| Volume | 88 |
| Issue number | 2 |
| DOIs | |
| State | Published - Feb 1996 |
| Externally published | Yes |
Keywords
- Label-correcting methods
- Parallel asynchronous algorithms
- Shared memory multiprocessors
- Shortest path problems
ASJC Scopus subject areas
- Management Science and Operations Research
- Control and Optimization
- Applied Mathematics