Analysis and experiments for a parallel solution to the all pairs shortest path problem
Ira Pramanick, Hub Ali · 1994
This paper proposes and analyzes a parallel implementation of the matrix product algorithm for the all pairs shortest path problem for a distributed memory MIMD model. The results of experiments conducted on a 128-processor hypercube machine show that the parallel implementation achieves the performance predicted by the analysis.>