The space complexity of unbounded timestamps

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4731 LNCS, Issue , 2007, Pages 223-237

  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; Shared memory; Timestamps

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INFORMATION SYSTEMS; PROBLEM SOLVING; REAL TIME SYSTEMS;

SHARED MEMORY; SPACE COMPLEXITY; TIMESTAMPS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 38049001161     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75142-7_19     Document Type: Conference Paper

References (22)

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 1-exclusion problem. ACM Transactions on Programming Languages and Systems 16(3), 939-953 (1994)
3. Attiya, H., Fouren, A.: Algorithms adapting to point contention. Journal of the ACM 50(4), 444-468 (2003)
4. Burns, J., Lynch, N.: Bounds on shared memory for mutual exclusion. Information and Computation 107(2), 171-184 (1993)
5. Charron-Bost, B.: Concerning the size of logical clocks in distributed systems. Information Processing Letters 39(1), 11-16 (1991)
6. Dolev, D., Shavit, N.: Bounded concurrent time-stamping. SIAM Journal on Computing 26(2), 418-455 (1997)
7. Dwork, C., Herlihy, M., Plotkin, S., Waarts, O.: Time-lapse snapshots. SIAM Journal on Computing 28(5), 1848-1874 (1999)
8. Dwork, C., Waarts, O.: Simple and efficient bounded concurrent timestamping and the traceable use abstraction. Journal of the ACM 46(5), 633-666 (1999)
9. 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)
10. Fich, F., Herlihy, M., Shavit, N.: On the space complexity of randomized synchronization. Journal of the ACM 45(5), 843-862 (1998)
11. Fidge, C.: Logical time in distributed computing systems. Computer 24(8), 28-33 (1991)
12. Guerraoui, R., Ruppert, E.: Anonymous and fault-tolerant shared-memory computing. Distributed Computing. A preliminary version appeared in Distributed Computing. In: 19th International Conference, pp. 244-259, 2006 (to appear)
13. Haldar, S., Vitányi, P.: Bounded concurrent timestamp systems using vector clocks. Journal of the ACM 49(1), 101-126 (2002)
14. Israeli, A., Li, M.: Bounded time-stamps. Distributed Computing 6(4), 205-209 (1993)
15. Israeli, A., Pinhasov, M.: A concurrent time-stamp scheme which is linear in time and space. In: Proc. 6th Int. Workshop on Distributed Algorithms, pp. 95-109 (1992)
16. Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for nonblocking implementations. SIAM Journal on Computing 30(2), 438-456 (2000)
17. Lamport, L.: A new solution of Dijkstra's concurrent programming problem. Communications of the ACM 17(8), 453-455 (1974)
18. Lamport, L.: Time, clocks and the ordering of events in a distributed system. Communications of the ACM 21(7), 558-565 (1978)
19. Li, M., Tromp, J., Vitányi, P.M.B.: How to share concurrent wait-free variables. Journal of the ACM 43(4), 723-746 (1996)
20. Mattern, F.: Virtual time and global states of distributed systems. In: Proc. Workshop on Parallel and Distributed Algorithms, pp. 215-226 (1989)
21. 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)
22. 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. IEEE Computer Society Press, Los Alamitos (1986)