ALL PAIRS SHORTEST PATHS ON A HYPERCUBE MULTIPROCESSOR.

John Jenq, Sartaj Sahni

Research output: Chapter in Book/Report/Conference proceedingConference contribution

29 Scopus citations

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 languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsSartaj K. Sahni
PublisherPennsylvania State Univ Press
Pages713-716
Number of pages4
ISBN (Print)0271006080
Publication statusPublished - 1 Dec 1987
EventProc Int Conf Parallel Process 1987 - Universal Park, PA, USA
Duration: 17 Aug 198721 Aug 1987

Other

OtherProc Int Conf Parallel Process 1987
CityUniversal Park, PA, USA
Period17/08/8721/08/87

    Fingerprint

Cite this

Jenq, J., & Sahni, S. (1987). ALL PAIRS SHORTEST PATHS ON A HYPERCUBE MULTIPROCESSOR. In S. K. Sahni (Ed.), Proceedings of the International Conference on Parallel Processing (pp. 713-716). Pennsylvania State Univ Press.