Scalable synchronous queues

Communications of the ACM

Volumn 52, Issue 5, 2009, Pages 100-108

  Scherer III, William N ^a   Lea, Doug ^b   Scott, Michael L ^c  

^a Rice University   (United States)

^b STATE UNIVERSITY OF NEW YORK AT OSWEGO   (United States)

^c University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTENTION-FREE; MICROBENCHMARKS; NON-BLOCKING; OPTERON;

DATA STRUCTURES; SPONTANEOUS EMISSION;

QUEUEING THEORY;

EID: 66149139155     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/1506409.1506431     Document Type: Article

References (21)

1. Anderson, T.E., Lazowska, E,D., Levy, H,M, The performance implications of thread management alternatives for shared-memory multiprocessors, IEEE Trans. Comput 38,12 (Dec. 1989), 1631-1644, (Pubitemid 20642725)
2. Andrews, G.R. Concurrent Programming: Principles and Practice. Benjamin/Cummings, 1991.
3. Hanson, D.R. C Interfaces and Implementations: Techniques for Creating Reusable Software. Addison-Wesley, 1997.
4. Hendler, D., Shavit, N., Yerushalmi, L. A scalable lock-free stack algorithm, In Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (Jun, 2004), 206-215.
5. Herlihy, M. Wait-free synchronization. ACM Trans. Prog. Lang. Syst. 13,1 (Jan. 1991), 124-149.
6. Herlihy, M., Luchangco, V., Moir, M., Obstruction-free synchronization: Double-ended queues as an example, In Proceedings of the 23rd International Conference on Distributed Computing Systems (May 2003).
7. Herlihy, M.P., Wing, J.M. Linearizability: A correctness condition for concurrent objects, ACM Trans. Prog. Lang. Syst. 12, 3 (Jul. 1990), 463-492.
8. Hoare, C.A.R. Communicating sequential processes, Commun. ACM 21, 8 (Aug. 1978), 666-677. (Pubitemid 8631635)
9. Karlin, A.R., Li, K., Manasse, M.S., Owicki, S. Empirical studies of competitive spinning for a shared-memory multiprocessor, In Proceedings of the 13th ACM Symposium on Operating Systems Principles (Oct. 1991), 41-55.
10. Lamport, L., A new solution of Dijkstra's concurrent programming problem, Commun. ACM 17,8 (Aug. 1974), 453-455.
11. Lamport, L., A fast mutual exclusion algorithm, ACM Trans. Comput. Syst. 5,1 (Feb. 1987), 1-11. (Pubitemid 17525482)
12. Lea, D. The java.util.concurrent Synchronizer Framework, Sci. Comput. Prog. 58, 3 (Dec. 2005), 293-309.
13. Mellor-Crummey, J.M., Scott, M.L. Algorithms for scalable synchronization on shared-memory multiprocessors, ACM Trans. Comput. Syst. 9,1 (Feb. 1991), 21-65.
14. Michael, M.M., Scott, M.l. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms, In Proceedings of the 15th ACM Symposium on Principles of Distributed Computing (May 1996), 267-275.
15. Moir, M., Nussbaum, D., Shalev, O., Shavit, N. Using elimination to implement scalable and lock-free FIFO queues. In Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (Jul. 2005), 253-262. (Pubitemid 43206578)
16. Scherer III, W.N. Synchronization and concurrency in user-level software systems, Ph.D. dissertation, Department of Computer Science, University of Rochester (Jan. 2006).
17. Scherer III, W.N., Lea, D., Scott, M.l. Scalable synchronous queues. In Proceedings of the 11th ACM Symposium on Principles and Practice of Parallel Programming (Mar. 2006).
18. Scherer III, W.N., Lea, D., Scott, M.l. A scalable elimination-based exchange channel. In Proceedings, Workshop on Synchronization and Concurrency in Object-Oriented Languages (Oct. 2005). In conjunction with OOPSLA '05.
19. Scherer III, W.N., Scott, M.l. Nonblocking concurrent objects with condition synchronization, In Proceedings of the 18th International Symposium on Distributed Computing (Oct. 2004).
20. Shavit, N., Touitou, D. Elimination trees and the construction of pools and stacks, In Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures (Jul. 1995).
21. Treiber, R.K. Systems programming: Coping with parallelism, Technical Report RJ 5118, IBM Almadén Research Center, Apr. 1986.