Optimism and consistency in partitioned distributed database systems
ACM Transactions on Database Systems (TODS)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Using process groups to implement failure detection in asynchronous environments
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
The Totem single-ring ordering and membership protocol
ACM Transactions on Computer Systems (TOCS)
The Transis approach to high availability cluster communication
Communications of the ACM
Horus: a flexible group communication system
Communications of the ACM
On the impossibility of group membership
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Specifying and using a partitionable group communication service
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Online computation and competitive analysis
Online computation and competitive analysis
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Primary Partition "Virtually-Synchronous Communication" harder than Consensus
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Strong and weak virtual synchrony in Horus
SRDS '96 Proceedings of the 15th Symposium on Reliable Distributed Systems
System Support for Partition-Aware Network Applications
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Consistent Failure Reporting in Reliable Communication Systems
Consistent Failure Reporting in Reliable Communication Systems
Group Membership and View Synchrony in Partitionable Asynchronous Distributed Systems: Specifications
Group communication services versus wide-area networks
Group communication services versus wide-area networks
Concurrency among strangers: programming in E as plan coordination
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Using web service transformations to implement cooperative fault tolerance
ISAS'06 Proceedings of the Third international conference on Service Availability
| Hi-index | 0.00 |
A partition-aware application is an application that can make progress in multiple connected components. In this paper, we examine a particular partition-aware application to evaluate the properties provided by different partitionable group membership protocols. The application we examine is a simple resource allocation problem that we call the Bancomat problem. We define a metric specific to this application, which we call the cushion, that captures the effects of the uncertainty of the global state caused from partitioning. We solve the Bancomat problem using four different approaches for building partition-aware applications. We compare the approaches in terms of their cushions and discuss how well different group membership protocols support the different approaches.