Using elimination to implement scalable and lock-free FIFO queues

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 253-262

  Moir, Mark ^a   Nussbaum, Daniel ^a   Shalev, Ori ^a,b   Shavit, Nir ^a  

^a SUN MICROSYSTEMS   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Elimination; FIFO queues; Linearizability; Lock free; Multiprocessors; Nonblocking synchronization; Scalability

Indexed keywords

ALGORITHMS; DATA STRUCTURES; SYNCHRONIZATION;

BACKOFF TECHNIQUE; FIFO QUEUES; LOCK-FREE; SCALABILITY;

QUEUEING THEORY;

EID: 32144436278     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1074013     Document Type: Conference Paper

References (25)

1. A. Agarwal and M. Cherian. Adaptive backoff synchronization techniques. In Proceedings of the 16th International Symposium on Computer Architecture, pages 396-406, May 1989.
2. W. Aiello, C. Busch, M. Herlihy, M. Mavronicolas, N. Shavit, and D. Touitou. Supporting increment and decrement operations in balancing networks. Lecture Notes in Computer Science, 1563:393-403, 1999.
3. D. Dolev and N. Shavit. Bounded concurrent time-stamping. SIAM J. Comput., 26(2):418-455, 1997.
4. J. Goodman, M. Vernon, and P. Woest. Efficient synchronization primitives for large-scale cache-coherent shared-memory multiprocessors. In Proceedings of the 3rd International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-III), pages 64-75. ACM Press, April 1989.
5. A. Gottlieb, R. Grishman, C. Kruskal, K. McAuliffe, L. Rudolph, and M. Snir. The NYU ultracomputer - designing an MIMD parallel computer. IEEE Transactions on Computers, C-32(2):175-189, February 1984.
6. A. Gottlieb, B. D. Lubachevsky, and L. Rudolph. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors. ACM Trans. Program. Lang. Syst., 5(2):164-189, 1983.
7. D. Hendler, N. Shavit, and L. Yerushalmi. A scalable lock-free stack algorithm. In SPAA'04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 206-215. ACM Press, 2004.
8. M. Herlihy, V. Luchangco, P. Martin, and M. Moir. Nonblocking memory management support for dynamic-sized data structures. ACM Trans. Comput. Syst., 23(2):146-196, 2005.
9. M. Herlihy and J. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990.
10. K. Hwang and F. A. Briggs. Computer Architecture and Parallel Processing. McGraw-Hill, Inc., 1990.
11. E. Ladan-Mozes and N. Shavit. An optimistic approach to lock-free fifo queues. In proceedings of the 18th International Conference on Distributed Computing (DISC), pages 117-131. Springer-Verlag GmbH, 2004.
12. L. Lamport. Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems, 5(2):190-222, 1983.
13. D. Lea. The Java concurrency package (JSR-166). http://gee.cs.oswego.edu/ dl/concurrency-interest/index.html.
14. J. M. Mellor-Crummey. Concurrent queues: Practical fetch-and-φ algorithms. Technical Report Technical Report 229, University of Rochester, November 1987.
15. M. M. Michael and M. L. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC'96), pages 267-275, New York, USA, May 1996. ACM.
16. M. Moir. Practical implementations of non-blocking synchronization primitives. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 219-228, 1997.
17. S. Prakash, Y.-H. Lee, and T. Johnson. Non-blocking algorithms for concurrent data structures. Technical Report 91-002, Department of Information Sciences, University of Florida, 1991.
18. S. Prakash, Y.-H. Lee, and T. Johnson. A non-blocking algorithm for shared queues using compare-and-swap. IEEE Transactions on Computers, 43(5):548-559, 1994.
19. W. N. Scherer and M. L. Scott. Nonblocking concurrent data structures with condition synchronization. In Proceedings of the 18th International Symposium on Distributed Computing, pages 174-187, Berlin, Heidelberg, New York, October 2004. Springer.
20. N. Shavit and D. Touitou. Elimination trees and the construction of pools and stacks. Theory of Computing Systems, 30:645-670, 1997.
21. N. Shavit and A. Zemach. Combining funnels: a dynamic approach to software combining. J. Parallel Distrib. Comput., 60(11):1355-1387, 2000.
22. H. S. Stone. High-performance computer architecture. Addison-Wesley Longman Publishing Co., Inc., 1987.
23. J. Stone. A simple and correct shared-queue algorithm using compare-and-swap. In Proceedings of the 1990 conference on Supercomputing, pages 495-504. IEEE Computer Society Press, 1990.
24. R. K. Treiber. Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center, April 1986.
25. J. Valois. Implementing lock-free queues. In Proceedings of the Seventh International Conference on Parallel and Distributed Computing Systems, pages 64-69, 1994.