Cart (Loading....) | Create Account
Close category search window
 

An efficient method for mutual exclusion in truly distributed systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hao Chen ; Dept. of Comput. Sci., Memorial Univ. of Newfoundland, St. John''s, Nfld., Canada ; Jian Tang

Many operations in a distributed system require mutual exclusion to guarantee correctness. Quorum methods have been widely proposed for implementing mutual exclusion. Majority voting is the best known quorum method. It has the merit of simplicity, but may incur high message overhead. The tree algorithm is an efficient structured quorum method for mutual exclusion problems. The quorums generated by a tree algorithm are smaller on average than those generated by a majority voting. However, the tree algorithm enforces a highly biased treatment to the nodes at different levels. This affects its performance in a distributed system where the nodes have similar characteristics. We propose a new structured quorum method which treats the nodes more evenly than the tree algorithm yet still preserves a satisfactory availability. We believe that this method is desirable for implementing mutual exclusion in a truly distributed system

Published in:

Distributed Computing Systems, 1994., Proceedings of the 14th International Conference on

Date of Conference:

21-24 Jun 1994

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.