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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.