Scalable synchronous queues

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn 2006, Issue , 2006, Pages 147-156

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

^a UNIVERSITY OF ROCHESTER   (United States)

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

Author keywords

Contention freedom; Dual data structures; Dual queue; Dual stack; Lock freedom; Nonblocking synchronization; Synchronous queue

Indexed keywords

ALGORITHMS; BENCHMARKING; CONCURRENCY CONTROL; DATA STRUCTURES; JAVA PROGRAMMING LANGUAGE; PROGRAM PROCESSORS;

CONTENTION FREEDOM; DUAL DATA STRUCTURES; DUAL STACK; LOCK FREEDOM; NONBLOCKING SYNCHRONIZATION; SYNCHRONOUS QUEUE;

QUEUEING THEORY;

EID: 33751044205     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1122971.1122994     Document Type: Conference Paper

References (21)

1. T. E. Anderson, E. D. Lazowska, and H. M. Levy. The Performance Implications of Thread Management Alternatives for Shared-Memory Multiprocessors, IEEE Trans. on Computers, 38(12):1631-1644, Dec. 1989.
2. G. R. Andrews. Concurrent Programming: Principles and Practice. Benjamin/Cummings, Redwood City, CA, 1991.
3. D. R. Hanson. C Interfaces and Implementations: Techniques for Creating Reusable Software. Addison-Wesley, Menlo Park, CA, 1997.
4. D. Hendler, N. Shavit, and L. Yerushalmi. A Scalable Lock-Free Stack Algorithm. In Proc. of the 16th Annual ACM Symp. on Parallelism in Algorithms and Architectures, pages 206-215, Barcelona, Spain, June 2004.
5. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-Free Synchronization: Double-Ended Queues as an Example. In Proc. of the 23rd Intl. Conf. on Distributed Computing Systems, Providence, RI, May, 2003.
6. M. P. Herlihy and J. M. Wing. Linearizability: A Correctness Condition for Concurrent Objects. ACM Trans. on Programming Languages and Systems, 12(3):463-492, July 1990.
7. M. Herlihy. Wait-Free Synchronization. ACM Trans. on Programming Languages and Systems, 13(1):124-149, Jan. 1991.
8. C. A. R. Hoare. Communicating Sequential Processes. Comm. of the ACM, 21(8):666-677, Aug. 1978.
9. A. R. Karlin, K. Li, M. S. Manasse, and S. Owicki. Empirical Studies of Competitive Spinning for a Shared-Memory Multiprocessor. In Proc, of the 13th ACM Symp. on Operating Systems Principles, pages 41-55, Pacific Grove, CA, Oct. 1991.
10. L.Lamport. A New Solution of Dijkstra's Concurrent Programming Problem. Comm. of the ACM, 17(8):453-455, Aug. 1974.
11. L.Lamport. A Fast Mutual Exclusion Algorithm. ACM Trans. on Computer Systems, 5(1):1-11, Feb. 1987.
12. D. Lea. The java.util.concurrent Synchronizer Framework. Science of Computer Programming, 58(3):293-309, Dec. 2005.
13. J. Manson, W. Pugh, and S. Adve. The Java Memory Model. In Conf. Record of the 32nd ACM Symp. on Principles of Programming Languages, Long Beach, CA, Jan. 2005.
14. J. M. Mellor-Crummey and M. L. Scott. Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. ACM Trans. on Computer Systems, 9(1):21-65, Feb. 1991.
15. M. M. Michael and M. L. Scott. Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In Proc. of the 15th ACM Symp. on Principles of Distributed Computing, pages 267-275, Philadelphia, PA, May 1996.
16. M. Moir, D. Nussbaum, O. Shalev, and N. Shavit. Using Elimination to Implement Scalable and Lock-Free FIFO Queues. In Proc. of the 17th Annual ACM Symp. on Parallelism in Algorithms and Architectures, pages 253-262, Las Vegas, NV, July 2005.
17. W. N. Scherer ni and M. L. Scott. Nonblocking Concurrent Objects with Condition Synchronization. In Proc. of the 18th Intl. Symp. on Distributed Computing, Amsterdam, The Netherlands, Oct. 2004.
18. W. N. Scherer in, D. Lea, and M. L. Scott. A Scalable Elimination-based Exchange Channel, In Proc., Workshop on Synchronization and Concurrency in Object-Oriented Languages, San Diego, CA, Oct. 2005. In conjunction with OOPSLA'05.
19. W. N. Scherer III. Synchronization and Concurrency in User-level Software Systems. Ph. D. dissertation, Dept. of Computer Science, Univ. of Rochester, Jan. 2006.
20. M. L. Scott and W. N. Scherer III. Scalable Queue-Based Spin Locks with Timeout. In Proc. of the 8th ACM Symp. on Principles and Practice of Parallel Programming, Snowbird, UT, June 2001.
21. N. Shavit and D. Touitou. Elimination Trees and the Construction of Pools and Stacks. In Proc. of the 7th Annual ACM Symp. on Parallel Algorithms and Architectures, Santa Barbara, CA, July 1995.