Brewer's Conjecture and the Feasibility of Consistent Available Partition-Tolerant Web Services (2002) [42 citations — 1 self]
Download:
http://theory.lcs.mit.edu/tds/papers/Gilbert/Brewe
http://people.csail.mit.edu/sethg/pubs/BrewersConj
CiteULike
CACHED:
|
http://theory.lcs.mit.edu/tds/papers/Gilbert/Brewe
http://people.csail.mit.edu/sethg/pubs/BrewersConj
CiteULike
CACHED:
|
by
Seth Gilbert
,
Nancy Lynch
In ACM SIGACT News
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Gilbert02brewer'sconjecture,
author = {Seth Gilbert and Nancy Lynch},
title = {Brewer's Conjecture and the Feasibility of Consistent Available Partition-Tolerant Web Services},
booktitle = {In ACM SIGACT News},
year = {2002},
pages = {2002}
}
author = {Seth Gilbert and Nancy Lynch},
title = {Brewer's Conjecture and the Feasibility of Consistent Available Partition-Tolerant Web Services},
booktitle = {In ACM SIGACT News},
year = {2002},
pages = {2002}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all three. In this note, we prove this conjecture in the asynchronous network model, and then discuss solutions to this dilemma in the partially synchronous model.
Citations
| 1052 | Distributed Algorithms – Lynch - 1996 |
| 583 | Linearizability: A correctness condition for concurrent objects – Herlihy, Wing - 1990 |
| 41 | On interprocess communication { parts – Lamport - 1986 |
| 35 | ªOn Interprocess Communication, Part II – Lamport - 1986 |
| 34 | Achievable cases in an asynchronous environment – Attiya, Bar-Noy, et al. - 1987 |
| 33 | Eventually-serializable data services – Fekete, Gupta, et al. |
| 5 | Towards robust distributed systems – Brewer - 2000 |
