Delta consistency

Delta consistency

Delta consistency is one of the consistency models used in the domain of parallel programming, for example in distributed shared memory, distributed transactions, and Optimistic replication

The delta consistency model states that an update will propagate through the system and all replicas will be consistent after a fixed time period δ. In other words, the result of any read operation is consistent with a read on the original copy of an object except for a (short) bounded interval after a modification. So basically, if you have an object which is modified, during the short period of time following its modification, the read will not be consistent. Then, after a fixed time period, the modification is propagated and the read will be consistent.

Sources

  • Communication Systems: The State of the Art : IFIP 17th World Computer Congress, Lyman Chapin ed. 2002



Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Consistency model — In computer science, consistency models are used in distributed systems like distributed shared memory systems or distributed data stores (such as a filesystems, databases, optimistic replication systems or Web caching). The system supports a… …   Wikipedia

  • Dirac bracket — The Dirac bracket is a generalization of the Poisson bracket developed by Paul Dirac to correctly treat systems with second class constraints in Hamiltonian mechanics and canonical quantization. It is an important part of Dirac s development of… …   Wikipedia

  • cell — cell1 cell like, adj. /sel/, n. 1. a small room, as in a convent or prison. 2. any of various small compartments or bounded areas forming part of a whole. 3. a small group acting as a unit within a larger organization: a local cell of the… …   Universalium

  • Description logic — (DL) is a family of formal knowledge representation languages. It is more expressive than propositional logic but has more efficient decision problems than first order predicate logic. DL is used in artificial intelligence for formal reasoning on …   Wikipedia

  • Abductive logic programming — is a high level knowledge representation framework that can be used to solve problems declaratively based on abductive reasoning. It extends normal Logic Programming by allowing some predicates to be incompletely defined, declared as abducible… …   Wikipedia

  • Sequent calculus — In proof theory and mathematical logic, sequent calculus is a family of formal systems sharing a certain style of inference and certain formal properties. The first sequent calculi, systems LK and LJ, were introduced by Gerhard Gentzen in 1934 as …   Wikipedia

  • China Airlines — Not to be confused with Air China, the flag carrier of the People s Republic of China. China Airlines Co., Ltd. 中華航空股份有限公司 IATA CI ICAO CAL …   Wikipedia

  • Maximum spacing estimation — The maximum spacing method tries to find a distribution function such that the spacings, D(i), are all approximately of the same length. This is done by maximizing their geometric mean. In statistics, maximum spacing estimation (MSE or MSP), or… …   Wikipedia

  • Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… …   Wikipedia

  • Numerical ordinary differential equations — Illustration of numerical integration for the differential equation y = y,y(0) = 1. Blue: the Euler method, green: the midpoint method, red: the exact solution, y = et. The step size is h = 1.0 …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”