Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
Quorum-Based Locking Protocol in Nested Invocations of Methods
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 2113/2001
Book
Database and Expert Systems Applications
DOI
10.1007/3-540-44759-8
Copyright
2001
ISBN
978-3-540-42527-4
DOI
10.1007/3-540-44759-8_83
Pages
857-866
Subject Collection
Computer Science
SpringerLink Date
Monday, January 01, 2001
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (226.4 KB)
Free Preview
Quorum-Based Locking Protocol in Nested Invocations of Methods
Katsuya Tanaka
8
and Makoto Takizawa
8
(8)
Dept. of Computers and Systems Engineering, Tokyo Denki University, Tokyo
Abstract
Objects are replicated in order to increase reliability and availability of an object-based system.We discuss how to invoke methods on replicas of objects in a nested manner. If a method
t
is invoked on multiple replicas and eachinstance of
t
on the replicas invokes a method
u
on another object
y
, u may be performed multiple times on some replica of
y
and then the replica gets inconsistent, i.e. redundant invocations. In addition, if eachinstance of
t
issues a request to a quorum, more number of the replicas are manipulated than the quorum number of the method u, i.e. quorum explosion.We discuss an invocation protocol to resolve the redundant invocation and quorum explosion. We evaluate the protocol on how many replicas are manipulated and requests are issued.
Katsuya
Tanaka
Email:
katsu@takilab.k.dendai.ac.jp
Makoto
Takizawa
Email:
taki@takilab.k.dendai.ac.jp
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.109 • Server: mpweb18
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)