Abstract
One way to achieve mutual exclusion in a distributed system is to assign votes to each site in the system. If the total number of votes is odd, the assignment is known to be nondominated, meaning that no other assignment can provide strictly greater access and still achieve mutual exclusion. We characterize in this note dominated even-totaled vote assignments. As a consequence, we obtain that the problem of determining whether an even-totaled vote assignment is dominated is trivial if each site is assigned exactly one vote; however, the problem is NP-complete in general.
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.
