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

Gilbert, Seth and Lynch, Nancy (2002) Brewer's Conjecture and the Feasability of Consistent, Available, Partition-Tolerant Web Services. ACM SIGACT News, 33 (2). pp. 51-59.

[img] Text
gilbert-lynch-brewer-conjecture.pdf
Restricted to Registered users only
Download (166kB)

Abstract

When designing distributed web services, there are three properties that are commonly desired: consistency, availablity, 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.

Item Type: Article
Subjects: Projects > BloSSom 2019
Main Topics > Distributed Systems
Divisions: Computer Science
Depositing User: Unnamed user with email richard.dabels@uni-rostock.de
Date Deposited: 03 Sep 2019 16:32
Last Modified: 03 Sep 2019 16:32
URI: http://blossom.informatik.uni-rostock.de/id/eprint/3

Actions (login required)

View Item View Item
Blockchain is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.