Abstract
Based on a CGM/BSP parallel algorithm for computing the transitive closure of an acyclic directed graph (digraph), we present a modified version that works for any digraph and show very promising implementation results. The original CGM/BSP algorithm for acyclic digraphs uses a linear extension labeling of the vertices. With this labeling, the original algorithm can be shown to require log p + 1 communication rounds, where p is the number of processors. The modified CGM/BSP algorithm works for any digraph and does not use the linear extension labeling. In theory the modified version no longer guarantees the O(log p) bound on the number of communication rounds, as shown by an artificially elaborated example that requires more than log p + 1 communication rounds. In practice, however, all the graphs tested use at most log p + 1 communication rounds. The implementation results are very promising and show the efficiency and scalability of the proposed modified algorithm, and compare favorably with other parallel implementations.
Partially supported by FINEP-PRONEX-SAI Proc. No. 76.97.1022.00, FAPESP Proc. No. 1997/10982-0, CNPq Proc. No. 52.3778/96-1, 55.2028/02-9, and FAPERJ.
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
Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput. 1, 131–137 (1972)
Baase, S.: Computer Algorithms - Introduction to Design and Analysis. Addison-Wesley, Reading (1993)
Cáceres, E.N., Song, S.W., Szwarcfiter, J.L.: A Parallel Algorithm for Transitive Closure. In: Proceedings the 14th IASTED International Conference on Parallel and Distributed Computing and Systems, Cambridge, U.S.A, November 4-6, pp. 114–116 (2002)
Chao, H.Y., Harper, M.P.: Minimizing redundant dependence and interprocessor synchronizations. International Journal of Parallel Programming 23, 245–262 (1995)
Dehne, F.: Coarse grained parallel algorithms. Special Issue of Algorithmica 24, 173–426 (1999)
Dehne, F., Fabri, A., Rau-Chaplin, A.: Scalable parallel computational geometry for coarse grained multicomputers. In: Proc. ACM 9th Annual Computational Geometry, pp. 298–307 (1993)
JáJá, J.: Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, Reading (1992)
Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays - Trees - Hypercubes. Morgan Kaufmann Publishers, San Francisco (1992)
Karp, R.M., Ramachandran, V.: Parallel Algorithms for Shared-Memory Machines. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. A, ch. 17, pp. 869–941. The MIT Press/Elsevier (1990)
Pagourtzis, A., Potapov, I., Rytter, W.: PVM Computation of the Transitive Closure: the Dependency Graph Approach. In: Cotronis, Y., Dongarra, J. (eds.) PVM/MPI 2001. LNCS, vol. 2131, pp. 249–256. Springer, Heidelberg (2001)
Pagourtzis, A., Potapov, I., Rytter, W.: Observations on Parallel Computation of Transitive and Max-Closure Problems. In: Kranzlmüller, D., Kacsuk, P., Dongarra, J., Volkert, J. (eds.) PVM/MPI 2002. LNCS, vol. 2474, pp. 217–225. Springer, Heidelberg (2002)
Purdon Jr., P.: A transitive closure algorithm. BIT 10, 76–94 (1970)
Roy, B.: Transitivité et connexité. C.R. Acad. Sci. Paris 249, 216–218 (1959)
Simon, K.: An improved algorithm for transitive closure on acyclic digraphs. Theoretical Computer Science 58, 325–346 (1988)
Toptsis, A.A.: Parallel transitive closure for multiprocessor. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds.) ICCI 1991. LNCS, vol. 497, pp. 197–206. Springer, Heidelberg (1991)
Valiant, L.G.: A bridging model for parallel computation. Communication of the ACM 33, 103–111 (1990)
Warshall, S.: A theorem on Boolean matrices. J. Assoc. Comput. Mach. 9, 11–12 (1962)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alves, C.E.R., Cáceres, E.N., Castro, A.A., Song, S.W., Szwarcfiter, J.L. (2003). Efficient Parallel Implementation of Transitive Closure of Digraphs. In: Dongarra, J., Laforenza, D., Orlando, S. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2003. Lecture Notes in Computer Science, vol 2840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39924-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-39924-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20149-6
Online ISBN: 978-3-540-39924-7
eBook Packages: Springer Book Archive