A Concurrent Time-Stamp Scheme which is Linear in Time and Space

A concurrent time-stamp scheme is an abstraction which enables the representation of temporal relationship among the objects of a distributed system. In this abstraction the system objects are labeled by a process called labeling. Using these labels a scanning process can return a set of labeled objects ordered temporally. In this paper we present a time-stamp system with linear time and space complexity. To achieve this complexity we introduce two way communication between labelers and scanners.

[1]  Amos Israeli,et al.  On processor coordination using asynchronous hardware , 1987, PODC '87.

[2]  Leslie Lamport,et al.  A new solution of Dijkstra's concurrent programming problem , 1974, Commun. ACM.

[3]  Maurice Herlihy,et al.  Time-Lapse Snapshots , 1992, SIAM J. Comput..

[4]  Nir Shavit,et al.  Atomic snapshots of shared memory , 1990, JACM.

[5]  Leslie Lamport,et al.  The mutual exclusion problem: part I—a theory of interprocess communication , 1986, JACM.

[6]  Cynthia Dwork,et al.  Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible! , 1992, STOC '92.

[7]  Amos Israeli,et al.  Bounded time-stamps , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[8]  Ambuj K. Singh,et al.  The elusive atomic register revisited , 1987, PODC '87.

[9]  Baruch Awerbuch,et al.  Atomic shared register access by asynchronous hardware , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[10]  Nir Shavit,et al.  Bounded concurrrent time-stamp systems are constructible , 1989, STOC '89.