A system architecture for enhanced availability of tightly coupled distributed systems
Authors:
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 8 pp.-407
Abstract
We present a system architecture which facilitates enhanced availability of tightly coupled distributed systems by temporarily relaxing constraint consistency. Three different types of consistency are distinguished in tightly coupled distributed systems - replica consistency, concurrency consistency, and constraint consistency. Constraint consistency defines the correctness of the system with respect to a set of data integrity rules (application defined predicates). Traditional systems either guarantee strong constraint consistency or no constraint consistency at all. However, a class of systems exists, where data integrity can be temporarily relaxed in order to enhance availability, i.e. constraint consistency can be traded against availability. This allows for a context- and situation-specific optimum of availability. This paper presents the basic concepts of the trading process and the proposed system architecture to enable a fine-grained tuning of the trade-off in tightly coupled distributed systems.Keywords
This publication has 17 references indexed in Scilit:
- Extended Membership Problem for Open Groups: Specification and SolutionLecture Notes in Computer Science, 2005
- Highly-available services using the primary-backup approach2003
- Understanding partitions and the 'no partition' assumption2002
- AQuA: an adaptive architecture that provides dependable distributed objects2002
- Design and evaluation of a conit-based continuous consistency model for replicated servicesACM Transactions on Computer Systems, 2002
- Distributed Systems for System Architects2001
- Software-based replication for fault toleranceComputer, 1997
- A critique of ANSI SQL isolation levelsACM SIGMOD Record, 1995
- Understanding fault-tolerant distributed systemsCommunications of the ACM, 1991
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990