Techniques for Concurrent Access to Different Data Structure: A Research Review

Kurukshetra University, Kurukshetra Summary The data structures used in concurrent systems need to be modified. Modifications of shared data structures are done in several steps. If these steps are interleaved with modifications from other tasks, this can result in inconsistency of the data structure. Therefore the data structure needs to be protected from other tasks modifying it while the operation is executing. This can either be done using mutual exclusion(locks)/nonblocking/optimistic methods. The focus of this paper is to give a preview on data structure with efficient and practical approach of concurrency control.

[1]  Philippas Tsigas,et al.  Fast and lock-free concurrent priority queues for multi-thread systems , 2005, J. Parallel Distributed Comput..

[2]  Rudolf Bayer,et al.  Concurrency of operations on B-trees , 1994, Acta Informatica.

[3]  Abraham Silberschatz,et al.  Operating System Concepts , 1983 .

[4]  C. Mohan,et al.  ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes , 1990, VLDB.

[5]  Mark Moir,et al.  Using elimination to implement scalable and lock-free FIFO queues , 2005, SPAA '05.

[6]  Nir Shavit,et al.  An optimistic approach to lock-free FIFO queues , 2004, Distributed Computing.

[7]  Sakti Pramanik,et al.  Parallel Processing of Large Node B-Trees , 1990, IEEE Trans. Computers.

[8]  Maged M. Michael,et al.  Simple, fast, and practical non-blocking and blocking concurrent queue algorithms , 1996, PODC '96.

[9]  S. B. Yao,et al.  Efficient locking for concurrent operations on B-trees , 1981, TODS.

[10]  Nir Shavit,et al.  Elimination Trees and the Construction of Pools and Stacks , 1997, Theory of Computing Systems.

[11]  William Pugh,et al.  Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.

[12]  Srinivasan Parthasarathy,et al.  An Efficient Algorithm for Concurrent Priority Queue Heaps , 1996, Inf. Process. Lett..

[13]  William Pugh,et al.  Concurrent maintenance of skip lists , 1990 .

[14]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[15]  Narsingh Deo,et al.  Parallel heap: An optimal parallel priority queue , 2004, The Journal of Supercomputing.

[16]  Theodore Johnson,et al.  A Highly Concurrent Priority Queue Based on the B-link Tree , 1991 .

[17]  Nir Shavit,et al.  The Baskets Queue , 2007, OPODIS.

[18]  John D. Valois.  Implementing Lock-Free Queues , 1994 .

[19]  Dominique Fober,et al.  GRAME. Centre national de création musicale , 2013, Tech. Sci. Informatiques.

[20]  Nir Shavit,et al.  Concurrent Priority Queue Algorithms , 1999, WDAS.

[21]  Philippas Tsigas,et al.  Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency , 2010, OPODIS.

[22]  Dominique Fober,et al.  Lock-Free Techniques for Concurrent Access to Shared Objects , 2002 .

[23]  Dennis Shasha,et al.  Locking without blocking: making lock based concurrent data structure algorithms nonblocking , 1992, PODS '92.

[24]  Nir Shavit,et al.  Skiplist-based concurrent priority queues , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.