ALL PAIRS SHORTEST PATHS ON A HYPERCUBE MULTIPROCESSOR.

John Jenq, Sartaj Sahni

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

29 Citations (Scopus)

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
StatePublished - 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

Shortest Path Algorithm
Multiprocessor
Hypercube
Shortest path

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.
Jenq, John ; Sahni, Sartaj. / ALL PAIRS SHORTEST PATHS ON A HYPERCUBE MULTIPROCESSOR. Proceedings of the International Conference on Parallel Processing. editor / Sartaj K. Sahni. Pennsylvania State Univ Press, 1987. pp. 713-716
@inproceedings{1ddb457b503347409826eddc676bb778,
title = "ALL PAIRS SHORTEST PATHS ON A HYPERCUBE MULTIPROCESSOR.",
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.",
author = "John Jenq and Sartaj Sahni",
year = "1987",
month = "12",
day = "1",
language = "English",
isbn = "0271006080",
pages = "713--716",
editor = "Sahni, {Sartaj K.}",
booktitle = "Proceedings of the International Conference on Parallel Processing",
publisher = "Pennsylvania State Univ Press",

}

Jenq, J & Sahni, S 1987, ALL PAIRS SHORTEST PATHS ON A HYPERCUBE MULTIPROCESSOR. in SK Sahni (ed.), Proceedings of the International Conference on Parallel Processing. Pennsylvania State Univ Press, pp. 713-716, Proc Int Conf Parallel Process 1987, Universal Park, PA, USA, 17/08/87.

ALL PAIRS SHORTEST PATHS ON A HYPERCUBE MULTIPROCESSOR. / Jenq, John; Sahni, Sartaj.

Proceedings of the International Conference on Parallel Processing. ed. / Sartaj K. Sahni. Pennsylvania State Univ Press, 1987. p. 713-716.

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

TY - GEN

T1 - ALL PAIRS SHORTEST PATHS ON A HYPERCUBE MULTIPROCESSOR.

AU - Jenq, John

AU - Sahni, Sartaj

PY - 1987/12/1

Y1 - 1987/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0023577384&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0023577384

SN - 0271006080

SP - 713

EP - 716

BT - Proceedings of the International Conference on Parallel Processing

A2 - Sahni, Sartaj K.

PB - Pennsylvania State Univ Press

ER -

Jenq J, Sahni S. ALL PAIRS SHORTEST PATHS ON A HYPERCUBE MULTIPROCESSOR. In Sahni SK, editor, Proceedings of the International Conference on Parallel Processing. Pennsylvania State Univ Press. 1987. p. 713-716