Computing with reads and writes in the absence of step contention

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

Volumn 3724 LNCS, Issue , 2005, Pages 122-136

  Attiya, Hagit ^a   Guerraoui, Rachid ^b   Kouznetsov, Petr ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

NON-CONSTANT STEP COMPLEXITY; OBSTRUCTION-FREE OBJECT IMPLEMENTATION; STEP CONTENTION;

COMPUTATIONAL COMPLEXITY; FAILURE ANALYSIS; LINEAR SYSTEMS;

CONCURRENT ENGINEERING;

EID: 33646415345     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11561927_11     Document Type: Conference Paper

References (26)

1. Y. Afek, G. Stupp, and D. Touitou. Long-lived adaptive collect with applications. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS), pages 262-272, 1999.
2. Y. Afek, G. Stupp, and D. Touitou. Long-lived adaptive splitter and applications. Distributed Computing, 15(2):67-86, 2002.
3. M. K. Aguilera and S. Frølund. Strict linearizability and the power of aborting. Technical report, HP Laboratories Palo Alto, 2003.
4. J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. J. Algorithms, 11(3):441-461, 1990.
5. H. Attiya and A. Fouren. Algorithms adapting to point contention. J. ACM, 50(4):444-468, 2003.
6. H. Attiya and J. L. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics (2nd edition). Wiley, 2004.
7. B. N. Bershad. Practical considerations for non-blocking concurrent objects. In Proceedings of the 14th IEEE International Conference on Distributed Computing Systems (ICDCS'93), pages 264-273, 1993.
8. T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685-722, July 1996.
9. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, March 1996.
10. D. Dolev, C. Dwork, and L. J. Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77-97, January 1987.
11. F. Fich, M. Herlihy, and N. Shavit. On the space complexity of randomized synchronization. J. ACM, 45(5):843-862, 1998.
12. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(3):374-382, April 1985.
13. E. Garni, M. Merritt, and G. Taubenfeld. The concurrency hierarchy, and algorithms for unbounded concurrency. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 161-169, 2001.
14. R. Guerraoui, M. Herlihy, and B. Pochon. Toward a theory of transactional contention managers. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), 2005.
15. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, January 1991.
16. M. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer III. Software transactional memory for dynamic-sized data structures. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 92-101, 2003.
17. M. Herlihy, V. Luchango, and M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems (ICDCS'03), pages 522-529, 2003.
18. M. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, June 1990.
19. P. Jayanti, K. Tan, and S. Toueg. Time and space lower bounds for nonblocking implementations. SIAM Journal on Computing, 30(2):438-456, 2000.
20. A. LaMarca. A performance evaluation of lock-free synchronization protocols. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 130-140, 1994.
21. L. Lamport. The part-time parliament. ACM Transactions on Computer Systems, 16(2):133-169, May 1998.
22. W.-K. Lo and V. Hadzilacos. Using failure detectors to solve consensus in asynchronous shared-memory systems. In Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG'94), volume 857 of LNCS, pages 280-295. Springer Verlag, 1994.
23. M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, pages 163-183, 1987.
24. V. Luchango, M. Moir, and N. Shavit. On the uncontended complexity of consensus. In Proceedings of the 17th International Symposium on Distributed Computing (DISC'03), pages 45-59, 2003.
25. M. L. Scott and W. N. Scherer III. Contention management in dynamic software transactional memory. In PODC Workshop on Concurrency and Synchronization in Java Programs, July 2004.
26. M. L. Scott and W. N. Scherer III. Advanced contention management for dynamic software transactional memory. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), 2005.