Abstract
Two plausible ways to implement Floyd's all-pairs-shortest-paths algorithm on a hypercube multiprocessor are considered. These are evaluated experimentally. A comparison with results for Dijkstra's single-source-all-destination algorithm on each processor is carried out.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Conference on Parallel Processing |
| Editors | Sartaj K. Sahni |
| Publisher | Pennsylvania State Univ Press |
| Pages | 713-716 |
| Number of pages | 4 |
| ISBN (Print) | 0271006080 |
| State | Published - 1 Dec 1987 |
| Event | Proc Int Conf Parallel Process 1987 - Universal Park, PA, USA Duration: 17 Aug 1987 → 21 Aug 1987 |
Other
| Other | Proc Int Conf Parallel Process 1987 |
|---|---|
| City | Universal Park, PA, USA |
| Period | 17/08/87 → 21/08/87 |