Close category search window
 

Quorum-based locking protocol for replicas in object-based 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)
Tanaka, K. ; Dept. of Comput. & Syst. Eng., Tokyo Denki Univ., Japan ; Takizawa, M.

We discuss how to lock replicated objects by extending the quorum concept and perform methods on replicas in a nested invocation. Each method is issued to a quorum. If a pair of methods are compatible, their quorums may not intersect in our protocol even if one of the methods is an update type. If a method t is invoked on multiple replicas and each instance of t invokes another update method u, u is performed multiple times on replicas and then the replicas get inconsistent, i.e. redundant invocation. In addition, since each instance issues a request to its own quorum, more replicas are locked than the quorum number, i.e. quorum explosion. We discuss how to resolve the redundant invocations and quorum explosion

Published in:
Autonomous Decentralized Systems, 2001. Proceedings. 5th International Symposium on

Date of Conference: 2001

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.