Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
ACM SIGACT News · 2002-06 · 33 (2) · 51-59
DOI: 10.1145/564585.564601 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM SIGACT News, 2002-06. Verfasst von Seth Gilbert und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1166-mal zitiert (Crossref) und nennt 5 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Gilbert, S., & Lynch, N. (2002). Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News, 33(2), 51-59. https://doi.org/10.1145/564585.564601
Vancouver
Gilbert S, Lynch N. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News. 2002;33(2):51-59. doi:10.1145/564585.564601
BibTeX
@article{Gilbert2002,
author = {Gilbert, Seth and Lynch, Nancy},
title = {Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services},
journal = {ACM SIGACT News},
year = {2002},
volume = {33},
number = {2},
pages = {51--59},
doi = {10.1145/564585.564601}
}
EUVIMED