Abstract
In [14] Chaudhuri et al. (1999) presented a strong, wait-free renaming algorithm for a synchronous message passing system with crash failures, which runs in an optimal O ( log n ) time, where n is the number of initially participating processors. Here, we extend their work by presenting a renaming algorithm which has similar characteristics and in addition is order-preserving. The new algorithm is based on an approximate agreement protocol.
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.
