The space complexity of unbounded timestamps

Distributed Computing

Volumn 21, Issue 2, 2008, Pages 103-115

  Ellen, Faith ^a   Fatourou, Panagiota ^b   Ruppert, Eric ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF IOANNINA   (Greece)

^c YORK UNIVERSITY   (Canada)

Author keywords

Anonymous; Lower bounds; Obstruction free; Shared memory; Timestamps; Wait free

Indexed keywords

COMPUTER NETWORKS; MICROFLUIDICS;

DISTRIBUTED COMPUTING; FINITE NUMBERS; GENERAL (CO); LOWER BOUNDS; SPACE COMPLEXITIES; SPRINGER (CO); TIME ORDERING; TIME STAMP (TS); TIMESTAMPS; UNIQUE IDENTIFIERS (UID);

INFORMATION SYSTEMS;

EID: 46249133032     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-008-0060-6     Document Type: Article

References (27)

1. Abrahamson, K.: On achieving consensus using a shared memory. In: Proc. 7th ACM Symposium on Principles of Distributed Computing, pp. 291-302 (1988)
2. Afek, Y., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: A bounded first-in, first-enabled solution to the l-exclusion problem. ACM Trans. Program. Lang. Syst. 16(3), 939-953 (1994)
3. Aspnes, J., Herlihy, M.: Fast, randomized consensus using shared memory. J. Algorithms 11(2), 441-461 (1990)
4. Attiya, H., Fouren, A.: Algorithms adapting to point contention. J. ACM 50(4), 444-468 (2003)
5. Burns, J., Lynch, N.: Bounds on shared memory for mutual exclusion. Inf. Comput. 107(2), 171-184 (1993)
6. Charron-Bost, B.: Concerning the size of logical clocks in distributed systems. Inf. Process. Lett. 39(1), 11-16 (1991)
7. Dolev, D., Shavit, N.: Bounded concurrent time-stamping. SIAM J. Comput. 26(2), 418-455 (1997)
8. Dwork, C., Herlihy, M., Plotkin, S., Waarts, O.: Time-lapse snapshots. SIAM J. Comput. 28(5), 1848-1874 (1999)
9. Dwork, C., Waarts, O.: Simple and efficient bounded concurrent timestamping and the traceable use abstraction. J. ACM 46(5), 633-666 (1999)
10. Ellen, F., Fatourou, P., Ruppert, E.: The space complexity of unbounded timestamps. In: Proc. Distributed Computing, 21st International Symposium. LNCS, vol. 4731, pp. 223-237 (2007)
11. Fatourou, P., Fich, F.E., Ruppert, E.: Time-space tradeoffs for implementations of snapshots. In: Proc. 38th ACM Symposium on Theory of Computing, pp. 169-178 (2006)
12. Fich, F., Herlihy, M., Shavit, N.: On the space complexity of randomized synchronization. J. ACM 45(5), 843-862 (1998)
13. Fidge, C.: Logical time in distributed computing systems. Computer 24(8), 28-33 (1991)
14. Guerraoui, R., Ruppert, E.: Anonymous and fault-tolerant shared-memory computing. Distrib. Comput. 20(3), 165-177 (2007)
15. Haldar, S., Vitányi, P.: Bounded concurrent timestamp systems using vector clocks. J. ACM 49(1), 101-126 (2002)
16. Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124-149 (1991)
17. Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: Proc. 23rd IEEE International Conference on Distributed Computing Systems, pp. 522-529 (2003)
18. Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463-492 (1990)
19. Israeli, A., Li, M.: Bounded time-stamps. Distrib. Comput. 6(4), 205-209 (1993)
20. Israeli, A., Pinhasov, M.: A concurrent time-stamp scheme which is linear in time and space. In: Proc. 6th International Workshop on Distributed Algorithms, pp. 95-109 (1992)
21. Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for nonblocking implementations. SIAM J. Comput. 30(2), 438-456 (2000)
22. Lamport, L.: A new solution of Dijkstra's concurrent programming problem. Commun. ACM 17(8), 453-455 (1974)
23. Lamport, L.: Time, clocks and the ordering of events in a distributed system. Commun. ACM 21(7), 558-565 (1978)
24. Li, M., Tromp, J., Vitányi, P.M.B.: How to share concurrent wait-free variables. J. ACM 43(4), 723-746 (1996)
25. Mattern, F.: Virtual time and global states of distributed systems. In: Proc. Workshop on Parallel and Distributed Algorithms, pp. 215-226 (1989)
26. Mavronicolas, M., Michael, L., Spirakis, P.: Computing on a partially eponymous ring. In: Proc. 10th International Conference on Principles of Distributed Systems, pp. 380-394 (2006)
27. Vitányi, P.M.B., Awerbuch, B.: Atomic shared register access by asynchronous hardware. In: Proc. 27th IEEE Symposium on Foundations of Computer Science, pp. 233-243 (1986)