2000 · 232 citations · 32 references
ComputingComputer ScienceComputer SystemsDatabasesDistributed SystemsFault ToleranceConsistency ModelsData RedundancyData ReplicationHigh AvailabilityReliable Distributed SystemsReliable System DesignConsistencyConsistency EnforcementConsistency GuaranteesConsistency ManagementConsistency MetricsMiddlewareOptimistic ReplicationStrong Consistency
The tradeoffs between consistency, performance, and availability are well understood. Traditionally, however, designers of replicated systems have been forced to choose from either strong consistency guarantees or none at all. This paper explores the semantic space between traditional strong and optimistic consistency models for replicated services. We argue that an important class of applications can tolerate relaxed consistency, but benefit from bounding the maximum rate of inconsistent access in an application-specific manner. Thus, we develop a set of metrics, Numerical Error, Order Error, and Staleness, to capture the consistency spectrum. We then present the design and implementation of TACT, a middleware layer that enforces arbitrary consistency bounds among replicas using these metrics. Finally, we show that three replicated applications demonstrate significant semantic and performance benefits from using our framework. 1 Introduction Replicating distributed services for incr...
32
Managing update conflicts in Bayou, a weakly connected replicated storage system
Doug Terry, Marvin Theimer, Karin Anna Petersen et al. · 1995 · 814 citations · Full text
Locality-aware request distribution in cluster-based network servers
Vivek S. Pai, Mohit Aron, Gaurov Banga et al. · ACM SIGPLAN Notices · 1998 · 503 citations · Full text
Flexible update propagation for weakly consistent replication
Karin Anna Petersen, Mike Spreitzer, Douglas B. Terry et al. · 1997 · 477 citations · Full text