Lock-free linked lists and skip lists
暂无分享,去创建一个
[1] Philippas Tsigas,et al. Fast and lock-free concurrent priority queues for multi-thread systems , 2005, J. Parallel Distributed Comput..
[2] Maged M. Michael. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes , 2002, PODC '02.
[3] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[4] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[5] Maurice Herlihy,et al. Linearizability: a correctness condition for concurrent objects , 1990, TOPL.
[6] Nir Shavit,et al. Split-ordered lists: lock-free extensible hash tables , 2003, PODC '03.
[7] Philippas Tsigas,et al. Scalable and lock-free concurrent dictionaries , 2004, SAC '04.
[8] Timothy L. Harris,et al. A Pragmatic Implementation of Non-blocking Linked-Lists , 2001, DISC.
[9] Keir Fraser,et al. Practical lock-freedom , 2003 .
[10] Robert Morris,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.
[11] Maged M. Michael,et al. High performance dynamic lock-free hash tables and list-based sets , 2002, SPAA '02.
[12] John D. Valois. Lock-free linked lists using compare-and-swap , 1995, PODC '95.
[13] Maurice Herlihy,et al. Wait-free synchronization , 1991, TOPL.
[14] Maurice Herlihy,et al. A methodology for implementing highly concurrent data objects , 1993, TOPL.
[15] Maurice Herlihy,et al. Lock-Free Garbage Collection for Multiprocessors , 1992, IEEE Trans. Parallel Distributed Syst..
[16] M. AdelsonVelskii,et al. AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .
[17] William Pugh,et al. Concurrent maintenance of skip lists , 1990 .
[18] David R. Cheriton,et al. Non-blocking synchronization and system design , 1999 .
[19] Maged M. Michael,et al. Correction of a Memory Management Method for Lock-Free Data Structures , 1995 .
[20] Nir Shavit,et al. Skiplist-based concurrent priority queues , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.
[21] William Pugh,et al. Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.