Early-Delivery Dynamic Atomic Broadcast (Extended Abstract) (2002)
Cached
Download Links
- [www.psrg.lcs.mit.edu]
- [www.psrg.lcs.mit.edu]
- [www.ee.technion.ac.il]
- [www.ee.technion.ac.il]
- [theory.csail.mit.edu]
- [www.cs.cmu.edu]
- [theory.lcs.mit.edu]
- [www.lcs.mit.edu]
- [www.lcs.mit.edu]
- [www.psrg.lcs.mit.edu]
- [www.psrg.lcs.mit.edu]
- [www.ee.technion.ac.il]
- [www.ee.technion.ac.il]
- [theory.csail.mit.edu]
- [theory.lcs.mit.edu]
- [theory.lcs.mit.edu]
- [theory.lcs.mit.edu]
- [theory.lcs.mit.edu]
- DBLP
Other Repositories/Bibliography
by
Ziv Bar-joseph
,
Idit Keidar
,
Nancy Lynch
| Venue: | IN PROC. 16TH INTL. SYMP. ON DISTRIBUTED COMPUTING (DISC’02), D. MALKHI, ED. LNCS |
| Citations: | 15 - 3 self |
BibTeX
@INPROCEEDINGS{Bar-joseph02early-deliverydynamic,
author = {Ziv Bar-joseph and Idit Keidar and Nancy Lynch},
title = {Early-Delivery Dynamic Atomic Broadcast (Extended Abstract)},
booktitle = {IN PROC. 16TH INTL. SYMP. ON DISTRIBUTED COMPUTING (DISC’02), D. MALKHI, ED. LNCS},
year = {2002},
pages = {1--16},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We consider a problem of atomic broadcast in a dynamic setting where processes may join, leave voluntarily, or fail (by stopping) during the course of computation. We provide a formal definition of the Dynamic Atomic Broadcast problem and present and analyze a new algorithm for its solution in a variant of a synchronous model, where processes have approximately synchronized clocks. Our
