Book Chapter10.1007/BFB0056496
Lifetime Based Consistency Protocols for Distributed Objects
Francisco J. Torres-Rojas,Mustaque Ahamad,Michel Raynal +2 more
- 24 Sep 1998
- pp 378-392
24
TL;DR: This work explores new consistency protocols based on the notion of object value lifetimes by keeping track of the lifetimes of the values stored in shared objects and finds that these protocols provide more efficient implementations.
read more
Abstract: Techniques such as replication and caching of objects that implement distributed services lead to consistency problems that must be addressed. We explore new consistency protocols based on the notion of object value lifetimes. By keeping track of the lifetimes of the values stored in shared objects (i.e., the time interval that goes from the writing of a value until the latest time when this value is known to be valid), it is possible to check the mutual consistency of a set of related objects cached at a site. Initially, this technique is presented assuming the presence of physical clocks. Later, these clocks are replaced by vector clocks and then by plausible clocks. Lifetimes based on such clocks result in weaker consistency but do provide more efficient implementations.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Plausible clocks: constant size logical clocks for distributed systems
TL;DR: This paper proposes a class of logical clocks called plausible clocks that can be implemented with a number of components not affected by the size of the system and yet they provide good ordering accuracy.
116
Timed consistency for shared distributed objects
Francisco J. Torres-Rojas,Mustaque Ahamad,Michel Raynal +2 more
- 01 May 1999
TL;DR: Timed consistency generalizes several existing consistency criteria and it is well suited for interactive and collaborative applications, where the action of one user must be seen by others in a timely fashion.
113
Consistency models for distributed interactive multimedia applications
TL;DR: Hints are provided to help DIMA designers to choose appropriate consistency models by first presenting meaningful psycho-perceptive characteristics of the real-world interactions and then discussing various consistency models according to them.
18
Convergence Through a Weak Consistency Model: Timed Causal Consistency
TL;DR: Timed Causal Consistency (TCC) as discussed by the authors is a real-time consistency model that includes time aspects within the framework of the model, which is a solution for overcoming that problem.
Ordering vs timeliness: two facets of consistency?
Mustaque Ahamad,Michel Raynal +1 more
TL;DR: This work believes that the characterization of consistency criteria using the orthogonal axes of ordering and timeliness helps to understand important issues related to shared objects in distributed systems.
10
References
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
TL;DR: Many large sequential computers execute operations in a different order than is specified by the program, and a correct execution by each processor does not guarantee the correct execution of the entire program.
Logical time in distributed computing systems
TL;DR: The partial ordering of events as defined by their causal relationships, that is, the ability of one event to directly, or transitively, affect another, is defined and its generalized and practical implementations in terms of partially ordered logical clocks are described.
545
Fault-tolerant Total Order Multicast to asynchronous groups
U. Fritzke,P. Ingels,Achour Mostefaoui,Michel Raynal +3 more
- 20 Oct 1998
TL;DR: The paper proposes a protocol based on two underlying building blocks, namely, Uniform Reliable Multicast and Uniform Consensus, based on which only the sender of a message and processes of its destination groups have to participate in the multicast of the message.
64