No Hot Spot Non-blocking Skip List
暂无分享,去创建一个
[1] Keir Fraser,et al. Practical lock-freedom , 2003 .
[2] Timothy L. Harris,et al. A Pragmatic Implementation of Non-blocking Linked-Lists , 2001, DISC.
[3] Michel Raynal,et al. A speculation‐friendly binary search tree , 2012, PPoPP '12.
[4] Maged M. Michael,et al. High performance dynamic lock-free hash tables and list-based sets , 2002, SPAA '02.
[5] Leslie Lamport,et al. On-the-fly garbage collection: an exercise in cooperation , 1975, CACM.
[6] Eric Ruppert,et al. Lock-free linked lists and skip lists , 2004, PODC '04.
[7] Philippas Tsigas,et al. Scalable and lock-free concurrent dictionaries , 2004, SAC '04.
[8] Maurice Herlihy,et al. A Simple Optimistic Skiplist Algorithm , 2007, SIROCCO.
[9] Derick Wood,et al. Concurrency control in database structures with relaxed balance , 1987, PODS '87.
[10] Mark Moir,et al. Lock-free reference counting , 2002, PODC '01.
[11] William Pugh,et al. Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.
[12] Maurice Herlihy,et al. Linearizability: a correctness condition for concurrent objects , 1990, TOPL.
[13] Kunle Olukotun,et al. Transactional collection classes , 2007, PPOPP.