暂无分享,去创建一个
[1] Faith Ellen,et al. Non-blocking binary search trees , 2010, PODC.
[2] C. A. R. Hoare,et al. Parallel Programming: An Axiomatic Approach , 1975, Comput. Lang..
[3] Neeraj Mittal,et al. CASTLE: fast concurrent internal binary search tree using edge-based locking , 2015, PPOPP.
[4] Dan Alistarh,et al. The SprayList: a scalable relaxed priority queue , 2015, PPoPP.
[5] Maged M. Michael,et al. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms , 1996, PODC '96.
[6] Erez Petrank,et al. Wait-free queues with multiple enqueuers and dequeuers , 2011, PPoPP '11.
[7] John D. Valois. Lock-free linked lists using compare-and-swap , 1995, PODC '95.
[8] Nir Shavit,et al. Software transactional memory , 1995, PODC '95.
[9] Allan Gottlieb,et al. Coordinating parallel processors: a partial unification , 1981, CARN.
[10] Tudor David,et al. Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures , 2015, ASPLOS.
[11] Mark D. Hill,et al. Amdahl's Law in the Multicore Era , 2008, Computer.
[12] Maurice Herlihy,et al. A Simple Optimistic Skiplist Algorithm , 2007, SIROCCO.
[13] Erez Petrank,et al. Wait-free linked-lists , 2012, PPoPP '12.