A Nonblocking Algorithm for Shared Queues Using Compare-and-Swap

IEEE Transactions on Computers

Volumn 43, Issue 5, 1994, Pages 548-559

  Prakash, Sundeep ^a   Lee, Yann Hang ^a   Johnson, Theodore ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DATA PROCESSING; DATA STRUCTURES; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; MULTIPROCESSING SYSTEMS; PERFORMANCE; PROGRAM PROCESSORS; QUEUEING THEORY; ROBUSTNESS (CONTROL SYSTEMS); SYNCHRONIZATION;

COMPARE AND SWAP; NONBLOCKING ALGORITHM; QUEUE LENGTH; REPLACE ADD; SHARED QUEUES;

ALGORITHMS;

EID: 0028436588     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.280802     Document Type: Article

References (17)

1. “TC2000 Programming Handbook,” BBN Advanced Computers, Inc.
2. A. Gottlieb, B. D. Lubachevsky, and L. Rudolph, “Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors,” ACM Trans. Programming Languages Syst., vol. 5, no. 2, pp. 164-189, Apr. 1993.
3. M. Herlihy, “A methodology for implementing highly concurrent data structures,” in Proc. 2nd ACM SIGPLAN on Principles and Practice of Parallel Programming, Mar. 1989, pp. 197-206.
4. M. Herlihy and J. Wing, “Axioms for concurrent objects,” in I4th ACM Symp. Principles of Programming Languages, Jan. 1987, pp. 13-26.
5. M. P. Herlihy, “Impossibility and universality results for wait-free synchronization,” in Seventh ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing, Aug. 1988, pp. 276-290.
6. H. T. Kung and J. T. Robinson, “On optimistic methods for concurrency control,” ACM Trans. Database Syst. vol. 6, no. 2. pp. 213-226, 1981.
7. L. Lamport, “Specifying concurrent program modules,” ACM Trans. Programming Languages Syst., vol. 5, no. 2, pp. 190-222, Apr. 1983.
8. “M68000 Family Programmer’s Reference Manual,” Motorola.
9. S. Prakash, “Non-blocking algorithms for concurrent data structures,” Masters thesis, Univ. of Florida, Dept. of Computer Sci., 1991. Available at anonymous ftp site cis.ufl.edu:cis/tech-reports/tr91/tr91-002.ps. Z.
10. I. K. Ryu and A. Thomasian, “Performance analysis of centralized databased with optimistic concurrency control,” Performance Evaluation 7, pp. 195-211, 1987.
11. J. M. Stone, “A simple and correct shared-queue algorithm using compare-and-swap,” in Proc. IEEE Comput. Society and ACM SIGARCH Supercomputing ' ‘90 Conf., Nov. 1990, pp. 495-505.
12. D. Shasha and N. Goodman, “Concurrent search structure algorithms,” ACM Trans. Database Syst., vol. 13, no. 1, pp. 53-90, Mar, 1988.
13. R. Kent Treiber, “Systems programming: Coping with parallelism,” RJ 5118, IBM Almaden Res. Ctr., Apr. 1986).
14. J. Turek, “Resilient computation in the presence of slowdowns,” Ph. D. Thesis, Dept. of Comput. Sci., NYU, 1991.
15. J. Turek, D. Shasha, and S. Prakash, “Locking without blocking: Making lock based concurrent data structure algorithms nonblocking,” in ACM Symp. Principles of Database Syst., 1992, pp. 212-222.
16. IBM T. J. Watson Res. Ctr., System/370 Principles of Operations, 1983, pp. 7.13, 14.
17. C.-Q. Zhu and P.-C. Yew, “A synchronization scheme and its applications for large multiprocessor systems,” in Proc. 4th Int. Conf. Distrib. Computing Syst., May 1984, pp. 486-493.