| Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services |
| Full text |
Pdf
(733 KB)
|
| Source
|
ACM SIGACT News
archive
Volume 33 , Issue 2 (June 2002)
table of contents
COLUMN: Technical columns
table of contents
Pages: 51 - 59
Year of Publication: 2002
ISSN:0163-5700
|
|
Authors
|
|
Seth Gilbert
|
Massachusetts Institute of Technology, Cambridge, MA
|
|
Nancy Lynch
|
Massachusetts Institute of Technology, Cambridge, MA
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 77, Downloads (12 Months): 467, Citation Count: 26
|
|
|
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, and Rüdiger Reischuk. Achievable cases in an asynchronous environment. In 28th Annual Symposium on Foundations of Computer Science, pages 337-346, Los Angeles, California, October 1987.
|
 |
2
|
|
 |
3
|
|
| |
4
|
Leslie Lamport. On interprocess communication --- parts I and II. Distributed Computing, 1(2):77-101, April 1986.
|
| |
5
|
|
CITED BY 26
|
|
|
|
|
Mehul A. Shah , Joseph M. Hellerstein , Eric Brewer, Highly available, fault-tolerant, parallel dataflows, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, June 13-18, 2004, Paris, France
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ryan Huebsch , Joseph M. Hellerstein , Nick Lanham , Boon Thau Loo , Scott Shenker , Ion Stoica, Querying the internet with PIER, Proceedings of the 29th international conference on Very large data bases, p.321-332, September 09-12, 2003, Berlin, Germany
|
|
|
|
|
|
|
|
|
|
|
|
Xuezheng Liu , Zhenyu Guo , Xi Wang , Feibo Chen , Xiaochen Lian , Jian Tang , Ming Wu , M. Frans Kaashoek , Zheng Zhang, D3S: debugging deployed distributed systems, Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation, p.423-437, April 16-18, 2008, San Francisco, California
|
|
|
Tallat M. Shafaat , Thorsten Schütt , Monika Moser , Seif Haridi , Ali Ghodsi , Alexander Reinefeld, Key-based consistency and availability in structured overlay networks, Proceedings of the 17th international symposium on High performance distributed computing, June 23-27, 2008, Boston, MA, USA
|
|
|
Matthias Brantner , Daniela Florescu , David Graf , Donald Kossmann , Tim Kraska, Building a database on S3, Proceedings of the 2008 ACM SIGMOD international conference on Management of data, June 09-12, 2008, Vancouver, Canada
|
|
|
|
|
|
|
|
|
|
|
|
Tallat M. Shafaat , Monika Moser , Thorsten Schütt , Alexander Reinefeld , Ali Ghodsi , Seif Haridi, Key-based consistency and availability in structured overlay networks, Proceedings of the 3rd international conference on Scalable information systems, June 04-06, 2008, Vico Equense, Italy
|
|
|
|
|
|
|
|
|
|
|
|
Jeremy Stribling , Yair Sovran , Irene Zhang , Xavid Pretzer , Jinyang Li , M. Frans Kaashoek , Robert Morris, Flexible, wide-area storage for distributed systems with WheelFS, Proceedings of the 6th USENIX symposium on Networked systems design and implementation, p.43-58, April 22-24, 2009, Boston, Massachusetts
|
|
|
Nalini Belaramani , Jiandan Zheng , Amol Nayate , Robert Soulé , Mike Dahlin , Robert Grimm, PADS: a policy architecture for distributed storage systems, Proceedings of the 6th USENIX symposium on Networked systems design and implementation, p.59-73, April 22-24, 2009, Boston, Massachusetts
|
|
|
|
|