Sciweavers

Share
SIGACT
2002

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

9 years 1 months ago
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
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.
Seth Gilbert, Nancy A. Lynch
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where SIGACT
Authors Seth Gilbert, Nancy A. Lynch
Comments (0)
books