ACM Home Page
Please provide us with feedback. Feedback
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
Full text PdfPdf (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
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 77,   Downloads (12 Months): 467,   Citation Count: 26
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/564585.564601
What is a DOI?

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
Collaborative Colleagues:
Seth Gilbert: colleagues
Nancy Lynch: colleagues