Scalability of Parallel Algorithms for the All-Pairs Shortest-Path Problem (original) (raw)
1991, Journal of Parallel and Distributed Computing
This paper uses the isoe ciency metric to analyze the scalability of several parallel algorithms for nding shortest paths between all pairs of nodes in a densely connected graph. Parallel algorithms analyzed in this paper have either been previously presented elsewhere or are small variations of them. Scalability is analyzed with respect to mesh, hypercube and shared-memory architectures. We demonstrate that isoe ciency functions are a compact and useful predictor of performance. In fact, previous comparative predictions of some of the algorithms based on experimental results are shown to be incorrect whereas isoe ciency functions predict correctly. We nd the classic tradeo s of hardware cost vs. time and memory vs. time to be represented here as tradeo s of hardware cost vs. scalability and memory vs. scalability.
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.