Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
 |
 |
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.},
apice = {CapproofSigactnews33},
author = {Seth Gilbert and Nancy Lynch},
doi = {10.1145/564585.564601},
journal = {ACM SIGACT News},
month = jun,
number = 2,
numpages = 9,
openalex = {W2054584570},
pages = {51--59},
publisher = {ACM},
title = {Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services},
url = {https://dl.acm.org/doi/10.1145/564585.564601},
volume = 33,
year = 2002
}