Summary
Time-stamps are labels which a system adds to its data items. These labels enable the system to keep track of the temporal precedence relations among its data elements. Many distributed protocols and some applications use the natural numbers as time-stamps. The natural numbers however are not useful for bounded protocols. In this paper we develop a theory ofbounded time-stamps. Time-stamp schemes are defined and the complexity of their implementation is analyzed. This indicates a direction for developing a general tool for converting time-stamp based protocols to bounded protocols.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Afek Y, Gafni E, Tromp J, Vitányi P: Wait-free test-and-set. In: Segall A, Zaks S (eds) Distributed algorithms (Proc 5th Int Workshop on Distributed Algorithms, Haifa, Israel, November 1992). Lecture Notes Comput Sci, Vol. 649. Springer, Berlin Heidelberg New York 1992, pp 95–109
Awerbuch B, Mansour Y, Shavit N: Polynomial end-to-end communication. Proc 30th Annual Symposium on Foundations of Computer Science, 1989, pp 358–363
Chor B, Israeli A, Li M: On processor coordination using asynchronous hardware. Proc 6th Annual ACM Symposium on Principles of Distributed Computing, 1987, pp 86–97
Dolev D., Shavit N: Bounded concurrent time-stamp systems are constructible. Proc 21st Annual ACM Symposium on Theory of Computing, 1989, pp 454–466
Dwork C, Herlihy M, Plotkin SA, Waarts O: Time-lapse snapshots. Proc Israeli Symposium on the Theory of Computing and Systems, 1992, pp 154–170
Dwork C, Waarts O: Simple efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible! Proc 24th Annual ACM Symposium on Theory of Computing, 1992, pp 655–666
Erdös P: On a problem of graph theory. Math Gazette 47:220–223 (1963)
Finn SG: Resynch procedures and a failsafe newtwork protocol. IEEE Trans Commun COM-27 (6):840–846 (1979)
Gawlick R, Lynch N, Shavit N: Concurrent timestamping made simple. Proc Israeli Symposium on the Theory of Computing and Systems, 1992, pp 171–183
Graham RL, Spencer JH: A construction to a tournament problem. Can Math Bull 14(1):45–48 (1971)
Israeli A, Li M: Bounded time-stamps. 28th Annual EEE Symposium on Foundations of Computer Science, 1987, pp 371–382
Israeli A, Pinhasov M: A concurrent time-stamp scheme which is linear in time and space. In: Segall A, Zaks S (eds) Distributed Algorithms (Proc 5th Int Workshop on Distributed Algorithms, Haifa, Israel, November 1992). Lect Notes Comput Sci, Vol. 649. Springer, Berlin Heidelberg New York 1992, pp 95–109
Katseff HP: A new solution to the critical section problem. Conference Record of the 10th Annual ACM Symposium on the Theory of Computing, Dan Diego May 1978, pp 86–88
Katz S, Shmueli O: Cooperative distributed algorithms for dynamic cycle prevention. IEEE Trans Software Eng SE 13(5):540–552 (1987)
Lamport L: A new solution of Dijkstra's concurrent programming problem. Commun ACM 17(8):453–455 (1974)
Lamport L: The mutual exclusion problem. Part I: a theory of interprocess communication. J ACM 33(2):313–326 (1986)
Lamport L: The mutual exclusion problem. Part II: statement and solutions. J ACM 33(2):327–348 (1986)
Segall A: Distributed network protocols. IEEE Trans Inf Theory IT-29(1):23–35 (1983)
Soloway SR, Humblet PA: On distributed network protocols for changing topologies. (preprint)
Szekeres E, Szekeres G: On a problem of schutte and by Erdös. Math Gazette 49:290–293 (1965)
Vitányi PMB, Awerbuch B: Atomic shared register access by asynchronous hardware. 27th Annual IEEE Symposium on Foundations of Computer Science, 1986, pp 233–243
Author information
Authors and Affiliations
Additional information
Amos Israeli received his B.Sc. in Mathematics and Physics from Hebrew University in 1976, and his M.Sc. and D.Sc. in Computer Science from the Weizmann Institute in 1980 and the Technion in 1985, respectively. Currently he is a senior lecturer at the Tlectrical Engineering Department at the Technion. Prior to this he was a postdoctoral fellow at the Aiken Computation Laboratory at Harvard. His research interests are in Parallel and Distributed Computing and in Robotics. In particular he has worked on the design and analysis of Wait-Free and Self-Stabilizing distributed protocols.
Ming Li received his M.S. and Ph.D. in Computer Science from Wayne State University in 1980 and Cornell University 1985, respectively. Currently he is an associate professor at the Computer Science Department at the University of Waterloo. His research interests are in Theory of Computing, Kolmogorov Complexity, and Machine Learning.
Supported in part by the Weizmann fellowship and NSF Grant DCR-86-00379
Supported in part by ONR Grant N00014-85-k-0445 and Army Research Office Grant DAAL03-86-K-0171 at Harvard University, by NSF Grant kDCR-86-06366 at Ohio State University, and by NSERC Operating Grant OGP0036747. Most of this work was done when the authors were at Aiken Computation Laboratory at Harvard University. The authors also acknowledge the hospitality of the computer science department at York University, Canada
Rights and permissions
About this article
Cite this article
Israeli, A., Li, M. Bounded time-stamps. Distrib Comput 6, 205–209 (1993). https://doi.org/10.1007/BF02242708
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02242708