Abstract
We investigate experimentally, alternative approaches to the distributed parallel computation of a class of problems related to the generic transitive closure problem and the algebraic path problem. Our main result is the comparison of two parallel algorithms for transitive closure,
-
a straightforward coarse-grained parallel implementation of the Warshall algorithm named Block-Processing (which also extends to the stronger algebraic path problem) and
-
a coarse-grained Three-Pass algorithm, introduced in this paper. Although this latter algorithm is more complicated, it behaves better for large problem sizes.
We show the relationship between the transitive closure problem and matrix multiplication — the latter problem has especially efficient PVM implementations which can be applied here. The synchronous shared memory model and several known intricate systolic algorithms are a good starting point for distributed implementations. We discuss alternative implementations and the suitability of the PVM model.
Preview
Unable to display preview. Download preview PDF.
References
A.Aho, J.Hopcroft, J.Ullman, The design and analysis of computer algorithms, Addison-Wesley (1974)
V. Alexandrov, K. Chan, A. Gibbons, W. Rytter, On the PVM/MPI computations of dynamic programming recurrences, EuroPVM-MPI'97, Lecture Notes in Comp. Science, Springer Verlag, 1997
A.Gibbons, W.Rytter, Efficient parallel algorithms, Cambridge University Press (1988)
L.Guibas, H.Thompson, C.Thompson, Direct VLSI implementation of combinatorial algorithms, Caltech Conf. on VLSI (1979)
H.T.Kung and Jaspal Subhlok, A new approach for automatic parallelization of blocked linear algebra computations, 122–129, Supercomputing '91. Proceedings of the 1991 Conference on Supercomputing, 1992
Sun-Yuan Kung, Sheng-Chun Lo, Paul.S.Lewis, Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems, IEEE Transactions on Computers, C-36, 5, 603–614, 1987
Hans-Werner Lang, Transitive Closure on the Instruction Systolic Array, 295–304, Proc. Int. Conf. on Systolic Arrays, San Diego
B. Maggs, S. Plotkin, Minimum cost spanning trees as a path finding problem, IPL 26 (1987) 191–293
Gunter Rote, A systolic array algorithm for the algebraic path problem, Computing, 34, 3, 191–219, 1985
S. Warshall, A Theorem on Boolean Matrices, J. Assoc. Comput. Mach. Vol 9 (1962)
F.L. Van-Scoy, The parallel recognition of a class of graphs, IEEE trans. Comp. C-29, (7) (1980) 563–570
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, K., Gibbons, A., Pias, M., Rytter, W. (1998). On the PVM computations of transitive closure and algebraic path problems. In: Alexandrov, V., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 1998. Lecture Notes in Computer Science, vol 1497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056593
Download citation
DOI: https://doi.org/10.1007/BFb0056593
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65041-6
Online ISBN: 978-3-540-49705-9
eBook Packages: Springer Book Archive