Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
Top Cited Papers
- 1 June 2002
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 33 (2) , 51-59
- https://doi.org/10.1145/564585.564601
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.Keywords
This publication has 4 references indexed in Scilit:
- Towards robust distributed systems (abstract)Published by Association for Computing Machinery (ACM) ,2000
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- Achievable cases in an asynchronous environmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- On interprocess communicationDistributed Computing, 1986