A simple optimistic skiplist algorithm

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

Volumn 4474 LNCS, Issue , 2007, Pages 124-138

  Herlihy, Maurice ^a,c   Lev, Yossi ^a,c   Luchangco, Victor ^c   Shavit, Nir ^b,c  

^a BROWN UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c SUN MICROSYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT ENGINEERING; DATA STRUCTURES; LARGE SCALE SYSTEMS; PATTERN RECOGNITION; SYNCHRONIZATION;

CONCURRENT SKIPLIST ALGORITHMS; SHORT LOCK-BASED VALIDATION;

PARALLEL ALGORITHMS;

EID: 38049123686     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72951-8_11     Document Type: Conference Paper

References (11)

1. Colvin, R., Groves, L., Luchangco, V., Moir, M.: Formal verification of a lazy concurrent list-based set. In: Proceedings of Computer-Aided Verification (August 2006)
2. Fraser, K.: Practical Lock-Freedom. PhD thesis, University of Cambridge (2004)
3. Fraser, K., Harris, T.: Concurrent programming without locks. Unpublished manuscript (2004)
4. Heller, S., Herlihy, M., Luchangco, V., Moir, M., Shavit, N., Scherer III, W.N.: A lazy concurrent list-based set algorithm. In: Proceedings of 9th International Conference on Principles of Distributed Systems (2005)
5. Herlihy, M., Wing, J.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3), 463-492 (1990)
6. Herlihy, M., Luchangco, V., Moir, M.: The repeat offender problem: A mechanism for supporting dynamic-sized, lock-free data structures. In: Proceedings of Distributed Computing: 16th International Conference (2002)
7. Lea, D.: Personal communication (2005)
8. Lea, D.: Concurrent Skip List Map. In java.util.concurrent
9. Michael, M.: Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Transactions on Parallel and Distributed Systems 15(6), 491-504 (June 2004)
10. Pugh, W.: Concurrent maintenance of skip lists. Technical Report CS-TR-2222, University of Maryland (1990)
11. Pugh, W.: A probabilistic alternative to balanced trees. Communications of the ACM 33(6), 668-676 (1990)