Title

All Pairs Shortest Paths on a Hypercube Multiprocessor.

Document Type

Conference Proceeding

Publication Date

12-1-1987

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.

This document is currently not available here.

Share

COinS