Abstract
The termination detection problem of a distributed computation has gained considerable interest recently. In this paper two symmetric solutions to this problem are presented in the special case, where the distributed computation is performed by a ring of processes. We shall discuss the problem in terms of processes communicating via shared variables instead of messages.
Sign-in/Register to access full text options 
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.
