Andrew: a distributed personal computing environment
Communications of the ACM - The MIT Press scientific computation series
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Heterogeneous distributed database systems for production use
ACM Computing Surveys (CSUR) - Special issue on heterogeneous databases
Disconnected operation in the Coda file system
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Eventually-serializable data services
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Flexible update propagation for weakly consistent replication
Proceedings of the sixteenth ACM symposium on Operating systems principles
Decentralized replicated-object protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The Wiki way: quick collaboration on the Web
The Wiki way: quick collaboration on the Web
Building Applications with Microsoft Outlook 2000 Technical Reference
Building Applications with Microsoft Outlook 2000 Technical Reference
Computer Supported Cooperative Work
Computer Supported Cooperative Work
The Challenges of Mobile Computing
Computer
Efficient Dynamic Voting Algorithms
Proceedings of the Fourth International Conference on Data Engineering
Session Guarantees for Weakly Consistent Replicated Data
PDIS '94 Proceedings of the Third International Conference on Parallel and Distributed Information Systems
Roam: A Scalable Replication System for Mobile Computing
DEXA '99 Proceedings of the 10th International Workshop on Database & Expert Systems Applications
Evaluating quorum systems over the Internet
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Support for Speculative Update Propagation and Mobility in Deno
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
MODELING REPLICA DIVERGENCE IN A WEAK-CONSISTENCY PROTOCOL FOR GLOBAL-SCALE DISTRIBUTED DATA BASES
MODELING REPLICA DIVERGENCE IN A WEAK-CONSISTENCY PROTOCOL FOR GLOBAL-SCALE DISTRIBUTED DATA BASES
Deno: A Decentralized, Peer-to-Peer Object-Replication System for Weakly Connected Environments
IEEE Transactions on Computers
Epidemic Algorithms for Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Version Control With Subversion
Version Control With Subversion
Replicated document management in a group communication system
CSCW '88 Proceedings of the 1988 ACM conference on Computer-supported cooperative work
ACM Computing Surveys (CSUR)
Design and evaluation of a continuous consistency model for replicated services
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Concurrency and Computation: Practice & Experience - Parallel and Distributed Computing (EuroPar 2005)
Vector-field consistency for ad-hoc gaming
Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
A comparison of optimistic approaches to collaborative editing of Wiki pages
COLCOM '07 Proceedings of the 2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing
Exploiting Our Computational Surroundings for Better Mobile Collaboration
MDM '07 Proceedings of the 2007 International Conference on Mobile Data Management
Unconscious eventual consistency with gossips
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
Optimistic replication is a fundamental technique for supporting collaborative work practices in mobile environments. However, eventual consistency, in contrast to immediate strong consistency in pessimistic replication, is much harder to evaluate. This paper analyzes different metrics for measuring the effectiveness of eventually consistent systems. Using results from a simulated environment of relevant optimistic replication protocols, we show that each metric hides previously undocumented side effects. These add considerable imprecision to any evaluation that exclusively relies on a single metric. Hence, we advocate a combined methodology comprising three complementary metrics: commit ratio, average agreement delay and average commit delay.