Close category search window
 

Optimization of nested invocation on 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.

An object-based system is composed of multiple objects which are encapsulation of data and methods. Objects are replicated in order to increase performance and throughput. 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 invocations. In addition, since each instance of a method issues a request to its own quorum, more number of the replicas are manipulated than the quorum number, i.e. quorum explosion. We discuss a protocol named QB (quorum-based) one to resolve the redundant invocations and quorum explosion. We show the number of replicas manipulated and requests issued are reduced by the QB protocol

Published in:
Parallel and Distributed Systems, 2001. ICPADS 2001. Proceedings. Eighth International Conference 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.