Abstract
We present new approaches to the parallel computation of a class of problems related to the Generic Transitive Closure problem (TC, in short). We identify the main ingredient of the TC problem called the Max-Closure Problem and concentrate on parallel computation of this subproblem, also we show how to reduce TC to matrix multiplication once the max-closure is computed. We present a new variation of the Warshall algorithm for Max-Closure, both in fine-grained and coarse-grained forms; the coarse-grained version, appropriate for parallel implementation in PVM is especially designed so as to consist of highly parellelisable submatrix multiplications. We used existing, especially efficient PVM subroutines to realise our new Max-Closure and TC algorithms; the experimental results show that the new algorithms achieve considerable improvement compared to previously known ones.
Work partially supported by GR/N09855 EPSRC grant.
Part of this work was done while this author was with the Department of Computer Science, University of Liverpool.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
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).
K. Chan, A. Gibbons, M. Pias, W. Rytter, On the PVM Computations of Transitive Closure and Algebraic Path Problems, in Proc. EuroPVM/MPI’98, 1998.
E. Fink, A Survey of Sequential and Systolic Algorithms for the Algebraic Path Problem, Technical Report CS-92-37, Dept. of CS, University of Waterloo, 1992.
L.Guibas, H.-T.Kung, 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, 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 Instrucion Systolic Array, 295–304, Proc. Int. Conf. on Systolic Arrays, San Diego, 1991.
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.
M. Yoeli, A note on a generalization of Boolean matrix theory, American Mathematical Monthly, 68 (1961), 552–557.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pagourtzis, A., Potapov, I., Rytter, W. (2002). Observations on Parallel Computation of Transitive and Max-Closure Problems. In: Kranzlmüller, D., Volkert, J., Kacsuk, P., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2002. Lecture Notes in Computer Science, vol 2474. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45825-5_37
Download citation
DOI: https://doi.org/10.1007/3-540-45825-5_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44296-7
Online ISBN: 978-3-540-45825-8
eBook Packages: Springer Book Archive