A pragmatic implementation of non-blocking linked-lists

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

Volumn 2180, Issue , 2001, Pages 300-314

  Harris, Timothy L ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

NON-BLOCKING;

ARTIFICIAL INTELLIGENCE;

EID: 84956970069     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45414-4_21     Document Type: Conference Paper

References (15)

1. Nimar S. Arora, Robert D. Blumofe, and C. Greg Plaxton. Thread scheduling for multiprogrammed multiprocessors. In Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 119–129, Puerto Vallarta, Mexico, June 28–July 2, 1998. SIGACT/SIGARCH.
2. Michael Greenwald and David Cheriton. The synergy between non-blocking synchronization and operating system structure. In USENIX, editor, 2nd Symposium on Operating Systems Design and Implementation (OSDI’96), October 28–31, 1996. Seattle, WA, pages 123–136, Berkeley, CA, USA, October 1996. USENIX.
3. M Greenwald. Non-blocking synchronization and system design. PhD thesis, Stanford University, August 1999. Technical report STAN-CS-TR-99-1624.
4. Maurice Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124–149, January 1991.
5. Maurice Herlihy. A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems, 15(5):745–770, November 1993.
6. Gerard J Holzmann. The moel checker SPIN. IEEE Transactions on Software Engineering, 23(5):279–295, May 1997.
7. Maurice P. Herlihy and Jeannette M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463–492, July 1990.
8. Radu Iosif and Riccardo Sisto. dSPIN: A dynamic extension of SPIN. In Proc. Of the 6th International SPIN Workshop, volume 1680 of LNCS, pages 261–276. Springer-Verlag, September 1999.
9. Richard Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons, July 1996.
10. Anthony LaMarca. A performance evaluation of lock-free synchronization protocols. In Proceedings of the Thirteenth Symposium on Principles of Distributed Computing, pages 130–140, 1994.
11. Henry Massalin and Calton Pu. A lock-free multiprocessor OS kernel. Technical Report CUCS-005-91, Columbia University, 1991.
12. Maged M. Michael and Michael L. Scott. Correction of a memory management method for lock-free data structures. Technical Report TR599, University of Rochester, Computer Science Department, December 1995.
13. Pentium Pro Family Developer’s Manual, volume 2, programmer’s reference manual. Intel Corporation, 1996. Reference number 242691-001.
14. John D. Valois. Lock-free linked lists using compare-and-swap. In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, pages 214–222, Ottawa, Ontario, Canada, 2–23 August 1995.
15. John D Valois. Personal communication. March 2001