Brewer's Conjecture and the Feasibility of Consistent Available Partition-Tolerant Web Services

Brewer's Conjecture and the Feasibility of Consistent Available Partition-Tolerant Web Services (2002)

by Seth Gilbert , Nancy Lynch

Venue:	In ACM SIGACT News
Citations:	95 - 2 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Brewer's Conjecture and the Feasibility of Consistent Available Partition-Tolerant Web Services	user correction - Legacy Corrections
AUTHOR NAME	Seth Gilbert	user correction - Legacy Corrections
AUTHOR NAME	Nancy Lynch	user correction - Legacy Corrections
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.	user correction - Legacy Corrections
YEAR	2002	INFERENCE
VENUE	In ACM SIGACT News	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	2002	INFERENCE
VOLUME	33	INFERENCE
CITATIONS	5 found	ParsCit 1.0