Abstract
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.
Partially supported by Technion VPR Funds — Japan TS Research Fund and B. & G. Greenberg Research Fund (Ottawa).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Afek Y., Attiya H., Dolev D., Gafni E., Merritt M., Shavit N.: Atomic snapshots of shared memory. Proc. 9th ACM Symp. on Principles of Distributed Computation (1990) pp. 1–13.
Chor B., Israeli A., Li M.: On processor coordination using asynchronous hardware. Proc. 6th ACM Symp. on Principles of Distributed Computation (1987) pp. 86–97.
Dolev D., Shavit N.: Bounded concurrent time-stamp systems are constructible! Proc. 21st Annual ACM Symp. on Theory of Computing (1989) pp. 454–466.
Dwork C, Waarts O.: Simple efficient bounded concurrent timestamping or Bounded concurrent timestamp systems are comprehensible! Proc. 24th Annual ACM Symp. on Theory of Computing (1992) pp. 655–666.
Dwork C., Herlihy M., Plotkin S.A., Waarts O.: Time-lapse snapshots. Proc. of the Israeli Symposium on the Theory of Computing and Systems (1992) pp. 154–170.
Herlihy M.P.: Waitfree implementations of concurrent objects. Proc. 7th ACM Symp. on Principles of Distributed Computation (1988) pp. 276–290.
Israeli A., Li M.: Bounded time-stamps. Proceedings of the 28th Annual Symposium on Foundations of Computer Science (1987) pp. 371–382.
Lamport L.: A new solution of Dijkstra's concurrent programming problem. CACM 17, 8 (1974) pp.453–455.
Lamport L.: The mutual exclusion problem. J. ACM 33, 2 (1986) pp.313–348.
Lamport L.: On interprocess communication. Distributed Computing 1, 2 (1986) pp. 77–101.
Li M., Tromp J., Vitanyi P.M.B.: How to share concurrent wait-free variables, preprint.
Pinhasov M.: A Linear-time bounded concurrent time-stamp scheme. M.Sc. thesis, Dept. of Computer Science, Technion, Haifa, Israel, (1991). (in Hebrew)
Singh A.K., Anderson J.H., Gouda M.G.: The elusive atomic register revisited. Proc. 6th ACM Symp. on Principles of Distributed Computation (1987) pp. 206–221.
Vitanyi P., Awerbuch B.: Atomic shared register access by asynchronous hardware. Proceedings of the 27th Annual Symposium on Foundations of Computer Science (1986) pp.233–243.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Israeli, A., Pinhasov, M. (1992). A concurrent time-stamp scheme which is linear in time and space. In: Segall, A., Zaks, S. (eds) Distributed Algorithms. WDAG 1992. Lecture Notes in Computer Science, vol 647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56188-9_7
Download citation
DOI: https://doi.org/10.1007/3-540-56188-9_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56188-0
Online ISBN: 978-3-540-47484-5
eBook Packages: Springer Book Archive