Real-time based strong consistency for distributed objects

A distributed computation satisfies sequential consistency if it is possible to establish a legal ordering of all the operations such that the program order of each site in the distributed system is respected. However, sequential consistency does not necessarily consider the particular real-time instant at which each operation is executed. A timed consistency model addresses how quickly the effects of an operation are perceived by the rest of the system, by requiring that if a write operation is executed at time t, it must be visible to the entire distributed system by time t+/spl Delta/.Timed consistency generalizes several existing consistency criteria and it is well suited for applications where the action of one user must be seen by others in a timely fashion.

[1]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[2]  Chengjie Liu,et al.  Maintaining Strong Cache Consistency in the World Wide Web , 1998, IEEE Trans. Computers.

[3]  Christos H. Papadimitriou,et al.  The serializability of concurrent database updates , 1979, JACM.

[4]  Margo I. Seltzer,et al.  World Wide Web Cache Consistency , 1996, USENIX Annual Technical Conference.

[5]  Jessica K. Hodgins,et al.  Temporal notions of synchronization and consistency in Beehive , 1997, SPAA '97.

[6]  Hagit Attiya,et al.  Sequential consistency versus linearizability , 1994, TOCS.

[7]  André Schiper,et al.  Lightweight causal and atomic group multicast , 1991, TOCS.

[8]  Roy T. Fielding,et al.  Hypertext Transfer Protocol - HTTP/1.1 , 1997, RFC.

[9]  Michel Raynal,et al.  Lifetime Based Consistency Protocols for Distributed Objects , 1998, DISC.

[10]  Tim Berners-Lee,et al.  Hypertext transfer protocol--http/i , 1993 .

[11]  Mustaque Ahamad,et al.  System support for scalable services , 1997 .

[12]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[13]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[14]  Karsten Schwan,et al.  Exploiting Temporal and Spatial Constraints on Distributed Shared Objects , 1997, ICDCS.

[15]  Michel Raynal,et al.  Normality: A Consistency Condition for Concurrent Objects , 1999, Parallel Process. Lett..

[16]  Hermann Kopetz,et al.  Clock Synchronization in Distributed Real-Time Systems , 1987, IEEE Transactions on Computers.

[17]  Mustaque Ahamad,et al.  Scalable approximations to causality and consistency of distributed objects , 1999 .

[18]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[19]  Mustaque Ahamad,et al.  A scalable technique for implementing multiple consistency levels for distributed objects , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[20]  David L. Mills.  Improved algorithms for synchronizing computer network clocks , 1994, SIGCOMM 1994.

[21]  Michel Raynal,et al.  Timed consistency for shared distributed objects , 1999, PODC '99.

[22]  David L. Mills.  Internet Time Synchronization: The Network Time Protocol , 1989, RFC.

[23]  Mark D. Hill,et al.  Implementing Sequential Consistency in Cache-Based Systems , 1990, ICPP.