A practical nonblocking queue algorithm using compare-and-swap

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 1999, Pages 470-475

  Shann, Chien Hua ^a   Huang, Ting Lu ^a   Chen, Cheng ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Compare and swap; Concurrent queue; Linearizability; Nonblocking

Indexed keywords

COMPARE AND SWAPS; FINITE ARRAY; LEVEL MECHANISM; MEMORY MANAGEMENT; MEMORY PROBLEMS; NON-BLOCKING; NONBLOCKING ALGORITHMS; QUEUE ALGORITHMS;

QUEUEING THEORY;

EID: 85114096057     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2000.857731     Document Type: Conference Paper

References (14)

1. J. Alemany and E. W. Felten, "Performance issues in nonblocking synchronization on shared-memory multiprocessors," in Proceedings of the Eleventh Symposium on Principles of Distributed Computing, pp. 125-134, 1992.
2. M. Herlihy, "A methodology for implementing highly concurrent data structures," in Proceedings ofthe Second ACM Symposium on Principles and Practice ofParallel Programming, pp. 197-206, 1990.
3. M. P. Herlihy and J. M. Wing, "Linearizability: A correctness condition for concurrent objects," ACM Transactions on Programming Languages and Systems, vol. 12, no. 3, pp. 463-492, 1990.
4. International Business Machines Corp., System/370 Principles of Operation, 1983.
5. A. LaMarca, "A performance evaluation of lock-free synchronization protocols," in Proceedings of the Thirteenth Symposium on Principles of Distributed Computing, pp. 130-140, 1994.
6. M. M. Michael and M. L. Scott, "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms," in Proceedings of the Fifteenth Symposium on Principles of Distributed Computing, pp. 267-275, 1996.
7. M. M. Michael and M. L. Scott, "Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors," Journal of Parallel and Distributed Computing, pp. 1-26, 1998.
8. S. Prakash, Y. H. Lee, and T. Johnson, "A non-blocking algorithm for shared queues using Compare-and-Swap," in Proceedings of the 1991 International Conference on Parallel Processing, pp. 68-75, 1991.
9. S. Prakash, Y. H. Lee, and T. Johnson, "A nonblocking algorithm for shared queues using compare-and-swap," IEEE Transactions on Computers, vol. 43, pp. 548-559, May 1994.
10. J. M. Stone, "A simple and correct shared-queue algorithm using Compare-and-Swap," in Proceedings of Supercomputing '90, pp. 495-504, 1990.
11. R. K. Treiber, "Systems programming: Coping with parallelism," Tech. Rep. RJ 5118, IBM Almaden Research Center, Apr. 1986.
12. J. D. Valois, Lock-Free Data Structures. PhD thesis, Rensselaer Polytechnic Institute, Department of Computer Science, 1995.
13. J. D. Valois, "Lock-free linked lists using compare-and-swap," in Proceedings of the Fourteenth Symposium on Principles of Distributed Computing, pp. 214-222, 1995.
14. J. M. Wing and C. Gong, "A library of concurrent objects and their proofs of correctness," Technical Report CMU-CS-90-151, Carnegie-Mellon University, 1990.