Paper: Brewer's Conjecture and the Feasibility of Consistent Available Partition-Tolerant Web Services
Wednesday, October 3, 2007 at 1:50AM
Todd Hoff in Paper

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.

Article originally appeared on (http://highscalability.com/).
See website for complete article licensing information.