Simple and efficient bounded concurrent timestamping and the traceable use abstraction

Journal of the ACM

Volumn 46, Issue 5, 1999, Pages 633-666

  Dwork, Cynthia ^a   Waarts, Orli ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Distributed computing; Distributed timestamps; Fault tolerant computing; Shared memory; Timestamping systems; Traceable use; Wait free algorithms

Indexed keywords

DISTRIBUTED COMPUTING; DISTRIBUTED TIMESTAMPS; FAULT-TOLERANT COMPUTING; SHARED MEMORY; TIMESTAMPING SYSTEMS; TRACEABLE-USE; WAIT-FREE ALGORITHMS;

ABSTRACTING; ALGORITHMS; COMPUTATIONAL METHODS; FAULT TOLERANT COMPUTER SYSTEMS; INVENTORY CONTROL; PROGRAM PROCESSORS; STORAGE ALLOCATION (COMPUTER);

REAL TIME SYSTEMS;

EID: 0142075126     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/324133.324161     Document Type: Article

References (20)

1. ATTIYA, H., RACHMAN, O. 1998. Atomic snapshots in O(n log ;i) operations. SLAM J. Comput. 27 (2), 319-340.
2. AFEK, Y., ATTIYA, H., DOLEV, D., GAFNI, E., MERRITT, M., SHAVIT, N. 1993. Atomic snapshots of shared memory. J. ACM 40 (4), 873-890.
3. DIJKSTRA, E. W. 1965. Solution of a problem in concurrent programming control. In Commun. ACM 8, 9 (Sept.), 569-570.
4. DWORK, C., HERLIHY, M. P., PLOTKIN, S. A., WAARTS, O. 1999. Time-lapse snapshots. SLAM J. Comput. To appear.
5. DWORK, C., HERLIHY, M., WAARTS, O. 1993. Bounded round numbers. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (Ithaca, N.Y., Aug. 15-18), ACM, New York, pp. 53-64.
6. DOLEY, D., SHAVIT, N. 1997. Bounded concurrent time-stamping. SLAM J. Comput. 26 (2), 418-455.
7. GAWLICK, R. 1992. Concurrent timestamping made simple. M.Sc. Thesis, MIT, Cambridge, Mass.
8. GAWLICK, R., LYNCH, N., SHAVIT, N. 1992. Concurrent timestamping made simple. In Proceedings of the Israel Symposium on the Theory of Computing and Systems (May), Lecture Notes in Computer Science, vol. 601. Springer-Verlag, New York, pp. 171-183.
9. HALDAR, S. 1993. Efficient bounded timestamping using traceable use abstraction-Is writer's guessing better than reader's telling? Tech. Rep. RUU-CS-93-28. Dept. Computer Science, Utrecht, (Sept.).
10. ISRAELI, A., Li, M. 1987. Bounded time stamps. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif, pp. 371-382.
11. ISRAELI, A., PINHASOV, M. 1991. A concurrent time-stamp scheme which is linear in time and space. In Proceedings of the 5th International Workshop on Distributed Algorithms. Lecture Notes in Computer Science, vol. 579. Springer-Verlag, New York, pp. 95-109.
12. KIROUSIS, L. M., SPIRAKIS, P., TSIGAS, P. 1991. Reading many variables in one atomic operation: Solutions with linear or sublinear complexity. In Proceedings of the 5th International Workshop on Distributed Algorithms. Lecture Notes in Computer Science, vol. 579. Springer-Verlag, New York, pp. 229-241.
13. LAMPORT, L. 1977. Concurrent reading and writing. Commun. ACM 20, 11 (Nov.), 806-811.
14. LAMPORT, L. 1986. The mutual exclusion problem. Part I: A Theory of interprocess communication. J. ACM 33, 2 (Apr.), 313-326.
15. LAMPORT, L. 1986. On interprocess communication. Part II: Algorithms. Dist. Comput. 1, 86-101.
16. PETERSON, G. 1983. Concurrent reading while writing. ACM Trans. Prog. Lang. Syst. 5, 1 (Jan.), 46-55.
17. SlNGH, A. K. 1992. Towards an understanding of unbounded variables in asynchronous systems. Inf. Proc. Lett. 42 (Apr.), 7-17.
18. SINGH, A. K., ANDERSON, J. H., GOUDA, M. G. 1994. The elusive atomic register. JACM 41, 2 (Mar.), 311-339.
19. TROMP, J. 1989. How to construct an atomic variable. In Proceedings of the 3rd International Workshop on Distributed Algorithms. Lecture Notes of Computer Science, vol. 392. Springer-Verlag, New York, pp. 292-302.
20. VITANYI, P. M. B., AwERBUCH, B. 1986. Atomic shared register access by asynchronous hardware. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 233-243.