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

Cached

Download Links

by Seth Gilbert , Nancy Lynch
Venue:In ACM SIGACT News
Citations:150 - 2 self

Active Bibliography

15 The Las-Vegas Processor Identity Problem (How and When to Be Unique – - 1993
Business Meeting of PODC 2002. Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services – - 2004
15 Zeno: Eventually Consistent Byzantine Fault Tolerance
65 Wait-Free Data Structures in the Asynchronous PRAM Model – - 2000
17 Persistent Nodes for Reliable Memory in Geographically Local Networks – - 2003
9 Critical Sections and Producer/Consumer Queues in Weak Memory Systems – - 1997
49 Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts – - 1997
28 Implementing Sequentially Consistent Shared Objects using Broadcast and Point-To-Point Communication – - 1998
3 An Algorithm for an Intermittently Atomic Data Service Based on Group Communication
6 Randomized two-process wait-free test-and-set – - 2002
31 Graceful quorum reconfiguration in a robust emulation of shared memory – - 2000
51 GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks – - 2004
2 A One-Round Algorithm for Virtually Synchronous Group Communication in Wide Are Networks – - 2002
5 Proving atomicity: An assertional approach – - 2005
1 Long Lived and Adaptive Shared Memory Implementations – - 2001
11 Naming Symmetric Processes Using Shared Variables – - 1994
2 Efficient Object Sharing in Shared-Memory Multiprocessors – - 1996
Robust Simulation of Shared Memory: 20 Years After ∗
Fully Adaptive Shared-Memory Algorithms – - 2004