Abstract
A distributed and fully symmetric algorithm is presented for solving the distributed termination problem. The algorithm does not make use of time stamps and clock synchronization and also does not depend on a pre-designated process for detecting termination condition.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
