Nonblocking concurrent data structures with condition synchronization

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

Volumn 3274, Issue , 2004, Pages 174-187

  Scherer III, William N ^a   Scott, Michael L ^a  

^a University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; LINEARIZATION; LOCKS (FASTENERS); SEMANTICS;

CONCURRENT DATA STRUCTURES; CONCURRENT OBJECTS; FOLLOW UP; LINEARIZABILITY; LOCK-FREE; NON-BLOCKING;

CONCURRENCY CONTROL;

EID: 35048813169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30186-8_13     Document Type: Article

References (13)

1. BBN Laboratories. Butterfly Parallel Processor Overview. BBN Report #6148, Version 1, Cambridge, MA, March 1986.
2. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-Free Synchronization: Double-Ended Queues as an Example. In Proceedings of the Twenty-Third International Conference on Distributed Computing Systems, Providence, RI, May, 2003.
3. M. P. Herlihy and J. M. Wing. Linearizability: A Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990.
4. M. Herlihy. Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, January 1991.
5. System/370 Principles of Operation. IBM Corporation, 1983.
6. L. Lamport. A New Solution of Dijkstra's Concurrent Programming Problem. Communications of the ACM, 17(8):453-455, August 1974.
7. L. Lamport. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM, 21(7):558-565, July 1978.
8. J. M. Mellor-Crummey and M. L. Scott. Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. ACM Transactions on Computer Systems, 9(l):21-65, February 1991.
9. M. M. Michael and M. L. Scott. Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In Proceedings of the Fifteenth ACM Symposium on Principles of Distributed Computing, pages 267-275, Philadelphia, PA, May 1996.
10. C. H. Papadimitriou. The Serializability of Concurrent Database Updates. Journal of the ACM, 26(4):631-653, October 1979.
11. Z. Radovic and E. Hagersten. Hierarchical Backoff Locks for Nonuniform Communication Architectures. In Proc of the Ninth International Symposium on High Performance Computer Architecture, pages 241-252, Anaheim, CA, February 2003.
12. M. L. Scott. Non-blocking Timeout in Scalable Queue-based Spin Locks. In Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, pages 31-40, Monterey, CA, July 2002.
13. R.K.Treiber. Systems Programming: Coping with Parallelism. RJ 5118, IBM Almaden Research Center, April 1986.