Abstract
In the set agreement problem, n processes have to decide on at most n − 1 of the proposed values. This paper considers asynchronous shared-memory systems equipped with an anti-Ω failure detector. Each query to the anti-Ω returns a process id; the specification ensures that there is a correct process whose id is returned only finitely many times. The main result is that anti-Ω is both necessary and sufficient to solve set agreement in the asynchronous shared memory model.
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.
