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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
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. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2840, 126–133. https://doi.org/10.1007/978-3-540-39924-7_21
Mendeley helps you to discover research relevant for your work.