Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

   page       BibTeX_logo.png   
Seth Gilbert, Nancy Lynch
ACM SIGACT News 33(2), pages 51–59
June 2002

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.

journal or series
book ACM SIGACT News (SIGACT News)