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.
|
 |
An Efficient Universal Construction for Message-Passing Systems
Extended Abstract
| Book Series | Lecture Notes in Computer Science |
| Publisher | Springer Berlin / Heidelberg |
| ISSN | 0302-9743 (Print) 1611-3349 (Online) |
| Volume | Volume 2508/2002 |
| Book | Distributed Computing |
| DOI | 10.1007/3-540-36108-1 |
| Copyright | 2002 |
| ISBN | 978-3-540-00073-0 |
| DOI | 10.1007/3-540-36108-1_9 |
| Pages | 133-147 |
| Subject Collection | Computer Science |
| SpringerLink Date | Tuesday, January 01, 2002 |
| |
|
An Efficient Universal Construction for Message-Passing Systems
Extended Abstract
Partha Dutta5, Svend Frølund6, Rachid Guerraoui5 and Bastian Pochon5
| (5) |
Distributed Programming Laboratory, Swiss Federal Institute of Technology, Lausanne, CH 1015 |
| (6) |
Hewlett-Packard Laboratories, Palo Alto, CA, 94304 |
Abstract
A universal construction is an algorithm that transforms any object with a sequential specification into a wait-free linearizable
implementation of that object. This paper presents a novel universal construction algorithm for a message-passing system with
process crash failures. Our algorithm relies on two fine-grained underlying abstractions: a weak form of leader election,
and a one-shot form of register.
Our algorithm is indulgent, efficient and generic. Being indulgent intuitively means that the algorithm preserves consistency even if the underlying system is asynchronous
for arbitrary periods of time. Compared to other indulgent universal constructions, our algorithm uses fewer messages and
gives rise to less work in steady-state. Our algorithm is generic in two senses: (1) although it is devised for a crash-stop
model, it can be easily ported to various crash-recovery models, and (2) although it is optimized for steady-state periods,
it can easily be extended to trade-off between steady-state performance and fail-over time.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|