On the uncontended complexity of consensus

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

Volumn 2848, Issue , 2003, Pages 45-59

  Luchangco, Victor ^a   Moir, Mark ^a   Shavit, Nir ^b  

^a SUN MICROSYSTEMS   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; LOCKS (FASTENERS); MILITARY OPERATIONS;

COMPARE AND SWAPS; COMPLEXITY MEASURES; FAST PATH; LOCK-FREE ALGORITHMS; STATE OF THE ART; TIME COMPLEXITY; WAIT-FREE; WORST-CASE ANALYSIS;

ALGORITHMS;

EID: 35248875793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39989-6_4     Document Type: Article

References (27)

1. N. S. Arora, R. D. Blumofe, and C. G. Plaxton. Thread scheduling for multiprogrammed multiprocessors. In Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 119-129, 1998.
2. B. N. Bershad. Practical considerations for non-blocking concurrent objects. In Proceedings 13th IEEE International Conference on Distributed Computing Systems, pages 264-273, 1993.
3. H. Buhrman, J. Garay, J. Hoepman, and M. Moir. Long-lived renaming made fast. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pages 194-203, 1995.
4. F. Fich, M. Herlihy, and N. Shavit. On the space complexity of randomized synchronization. Journal of the ACM, 45(5):843-862, 1998.
5. M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, pages 374-382, 1985.
6. T. L. Harris. A pragmatic implementation of non-blocking linked lists. In Proceedings of the 15th International Symposium on Distributed Computing, 2001.
7. T. L. Harris, K. Fraser, and I. A. Pratt. A practical multi-word compare-and-swap operation. In Proceedings of 16th International Symposium on DIStributed Computing, 2002.
8. D. Hendler and N. Shavit. Non-blocking steal-half work queues. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing, pages 280-289, 2002.
9. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, 1991.
10. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free software NCAS and transactional memory. Unpublished manuscript, 2002.
11. M. Herlihy, V. Luchangco, and M. Moir. The repeat offender problem: A mechanism for supporting lock-free dynamic-sized data structures. In Proceedings of the 16th International Symposium on Distributed Computing, 2002. A improved version of this paper is in preparation for journal submission; please contact authors.
12. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In Proceedings of the 23rd International Conference on Distributed Computing Systems, 2003.
13. M. Herlihy, V. Luchangco, and M. Moir. Space- and time-adaptive nonblocking algorithms. In Proceedings of Computing: The Australasian Theory Symposium (CATS), 2003.
14. M. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer III. Software transactional memory of dynamic-sized data structures. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing, 2003.
15. M. Herlihy and J. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, 1990.
16. K. Kawachiya, A. Koseki, and T. Onodera. Lock reservation: Java locks can mostly do without atomic operations. In Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 130-141, 2002.
17. A. LaMarca. A performance evaluation of lock-free synchronization protocols. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 130-140, Los Angeles, CA, 1994.
18. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocessor programs. IEEE Transactions on Computers, C-28(9):690-691, 1979.
19. L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1):1-11, 1987.
20. M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. In F. P. Preparata, editor, Advances in Computing Research, volume 4, pages 163-183. JAI Press, 1987.
21. V. Luchangco, M. Moir, and N. Shavit. On the uncontended complexity of consensus. In preparation, 2002.
22. N. Lynch and F. Vaandrager. Forward and backward simulations - part I: Untimed systems. Information and Computation, 121(2):214-233, 1995.
23. M. M. Michael. High performance dynamic lock-free hash tables and list-based sets. In Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 73-82, 2002.
24. M. Moir and J. Anderson. Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming, 25:1-39, 1995.
25. A preliminary version appeared in Proceedings of the 8th International Workshop on Distributed Algorithms, 1994, pp. 141-155.
26. M. Saks, N. Shavit, and H. Woll. Optimal time randomized consensus - making resilient algorithms fast in practice. In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete algorithms, pages 351-362, 1991.
27. O. Shalev and N. Shavit. Split-ordered lists -lock-free resizable hash tables. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing, 2003.