Lock-free linked lists and skip lists

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 50-59

  Fomitchev, Mikhail ^a   Ruppert, Eric ^a  

^a YORK UNIVERSITY   (Canada)

Author keywords

Amortized analysis; Analysis; Distributed; Efficient; Fault tolerant; Linked list; Lock free; Skip list

Indexed keywords

ALGORITHMS; ANALYSIS; DATA STRUCTURES; FAULT TOLERANT COMPUTER SYSTEMS; SCHEDULING; SYNCHRONIZATION;

AMORTIZED ANALYSIS; EFFICIENT; LINKED LIST; LOCK-FREE; SKIP LIST;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 10444237205     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011776     Document Type: Conference Paper

References (17)

1. M. Fomitchev. Lock-free linked lists and skip lists. Master's thesis, York University, October 2003. http://www.cs.yorku.ca/~mikhail.
2. K. A. Fraser. Practical lock-freedom. PhD thesis, University of Cambridge, December 2003. Technical Report UCAM-CL-TR-579.
3. T. L. Harris. A pragmatic implementation of non-blocking linked-lists. In Proceedings of the 15th International Symposium on Distributed Computing, pages 300-314, 2001.
4. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, 1991.
5. M. Herlihy. A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems, 15(5):745-770, 1993.
6. M. Herlihy and J. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, 1990.
7. IBM System/370 extended architecture, principles of operation., 1983. IBM Publication No. SA22-7085.
8. M. M. Michael. High performance dynamic lock-free hash tables and list-based sets. In Proceedings of the 14th annual ACM Symposium on Parallel Algorithms and Architectures, pages 73-82, 2002.
9. M. M. Michael. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In Proceedings of the 21st Annual Symposium on Principles of Distributed Computing, 2002.
10. M. M. Michael and M. L. Scott. Correction of a memory management method for lock-free data structures. Technical Report TR599, Computer Science Department, University of Rochester, 1995.
11. W. Pugh. Concurrent maintenance of skip lists. Technical Report CS-TR-2222, Computer Science Department, University of Maryland, 1990.
12. W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Communications of ACM, 33(6):668-676, 1990.
13. N. Shavit and I. Lotan. Skiplist-based concurrent priority queues. In Proc. 14th IEEE/ACM International Parallel and Distributed Processing Symposium, pages 263-268, 2000.
14. H. Sundeil and P. Tsigas. Fast and lock-free concurrent priority queues for multi-thread systems. In Proceedings of the 17th IEEE/ACM International Parallel and Distributed Processing Symposium, pages 84-94, April 2003.
15. H. Sundell and P. Tsigas. Scalable and lock-free concurrent dictionaries. In Proceedings of the 19th ACM Symposium on Applied Computing, pages 1438-1445, March 2004.
16. R. K. Treiber. Systems programming: Coping with parallelism. Research report RJ 5118, IBM Almaden Research Center, 1986.
17. J. D. Valois. Lock-free linked lists using compare-and-swap. In Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, pages 214-222, 1995.