Abstract
In this paper we present an algorithm for solving the distributed termination detection problem. In particular, a strategy based on message counting is used to detect the termination of a distributed computation consisting of a set of processes asynchronously communicating over communication links. The proposed algorithm does not require the FIFO property for the communication links. The assumptions regarding the connectivity of the processes are very simple. For the proposed algorithm we demonstrate the correctness, we evaluate the message and the bit complexity and we give a detailed description of a MPI implementation.
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 callDisclaimer: 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.
