Seth Gilbert, Nancy Lynch  Home/Search
Context
Related
| mit.edu/tds/papers/Gilbert...Brewer6.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/tds/lynchpubs (more) Homepages: S.Gilbert |
Rate this article:      (best)Comment on this article |
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. (Update)
Active bibliography (related documents): More All
0.0: Naming Symmetric Processes Using Shared Variables - Egecioglu, Singh (1994) (Correct)
0.0: Concurrent Timestamping Made Simple - Gawlick (1992) (Correct)
0.0: Efficient Object Sharing in Shared-Memory Multiprocessors - Moir (1996) (Correct)
Similar documents based on text: More All
0.3: Building Reliable Web Services Compositions - Pires, Benevides, Mattoso (2002) (Correct)
0.3: On the Management of Compositions of Web Services - Tosic, Pagurek, Esfandiari.. (2001) (Correct)
0.3: A Framework for Facilitating Dynamic e-Business Via.. - Akkiraju, Flaxer.. (2001) (Correct)
BibTeX entry: (Update)
@misc{ gilbert-brewers,
author = "Seth Gilbert and Nancy Lynch",
title = "Brewer's Conjecture and the Feasibility of Consistent Available Partition-Tolerant
Web Services",
url = "citeseer.ist.psu.edu/544596.html" }
Citations (may not include all citations):718 Distributed Algorithms (context) - Lynch - 1996
326 Linearizability: A correctness condition for concurrent obje.. (context) - Herlihy, Wing - 1990
52 parts I and II (context) - Lamport, communication - 1986
36 Achievable cases in an asynchronous environment (context) - Attiya, Bar-Noy et al. - 1987
1 Towards robust distributed systems (context) - Brewer - 2000
Documents on the same site (http://theory.lcs.mit.edu/tds/lynch-pubs.html): More
Hybrid I/O Automata Revisited - Lynch, Segala, Vaandrager (2001) (Correct)
"Helping": Several Formalizations - Lynch (1975) (Correct)
Fast Allocation Of Nearby Resources In A Distributed System - Lynch (1980) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC