Concurrent Access Algorithms for Different Data Structures: A Research Review

Concurrent Access Algorithms for Different Data Structures: A Research Review

Ms. Ranjeet Kaur

Contact

Dr. Pushpa Rani Suri

Contact

1 Kurukshetra University, Kurukshetra

GJCST Volume 14 Issue C3

Article Fingerprint

ReserarchID

CSTSDEG7PM7

Concurrent Access Algorithms for Different Data Structures: A Research Review Banner

Algorithms for concurrent data structure have gained attention in recent years as multi-core processors have become ubiquitous. Several features of shared-memory multiprocessors make concurrent data structures significantly more difficult to design and to verify as correct than their sequential counterparts. The primary source of this additional difficulty is concurrency. This paper provides an overview of the some concurrent access algorithms for different data structures.

32 Cites in Articles

References

R Treiber (1986). Systems programming: Coping with parallelism.
Maged Michael,Michael Scott (1998). Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory Multiprocessors.
Danny Hendler,Nir Shavit,Lena Yerushalmi (2004). A scalable lock-free stack algorithm.
J Valois (1994). Implementing Lock-Free queues.
M Michael,M Scott (1996). Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms.
Mark Moir,Daniel Nussbaum,Ori Shalev,Nir Shavit Using elimination to implement scalable and lock-free FIFO queues.
H Kung,Philip Lehman (1980). Concurrent manipulation of binary search trees.
Philip Lehman,S Yao (1981). Efficient locking for concurrent operations on B-trees.
Yehoshua Sagiv (1986). Concurrent operations on B∗-trees with overtaking.
V Lanin,D Shasha (1986). A symmetric concurrent b-tree algorithm.
J Biswas,J Browne (1987). Simultaneous update of priority structures.
V Rao,V Kumar (1988). Concurrent access of priority queues.
R Ayani (1991). LR-algorithm: concurrent operations on priority queues.
Galen Hunt,Maged Michael,Srinivasan Parthasarathy,Michael Scott (1996). An efficient algorithm for concurrent priority queue heaps.
N Lotan,Shavit (2000). Skiplist-Based Concurrent Priority Queues.
H Sundell,P Tsigas Fast and Lock-Free Concurrent Priority Queues for Multithread System.
T Johnson (1991). A highly concurrent priority queue based on the b-link tree.
Q Huang,W Weihl (1991). An evaluation of concurrent priority queue algorithms.
John Valois (1995). Lock-free linked lists using compare-and-swap.
Timothy Harris (2001). A Pragmatic Implementation of Non-blocking Linked-lists.
Maged Michael (2002). High performance dynamic lock-free hash tables and list-based sets.
M Greenwald (1999). Non-Blocking Synchronization and System Design.
N Shavit,D Touitou (1997). Elimination Trees and the Construction of Pools and Stacks.
M Herlihy (1993). A methodology for implementing highly concurrent data objects.
M Herlihy,J Wing (1990). Linearizability: a Correctness Condition for Concurrent Objects.
H Sundell,P Tsigas (2002). Proceedings of the 7th workshop on Workshop on languages, compilers, and run-time support for scalable systems.
Philippas Tsigas,Yi Zhang (2002). Integrating non-blocking synchronisation in parallel applications.
Maurice Herlihy (1993). A methodology for implementing highly concurrent data objects.
John Mellor-Crummey,Michael Scott (1991). Algorithms for scalable synchronization on shared-memory multiprocessors.
John Turek,Dennis Shasha,Sundeep Prakash (1992). Locking without blocking.
W Pugh (1989). Concurrent Maintenance of Skip Lists.
William Pugh (1990). Skip lists: a probabilistic alternative to balanced trees.

Download References

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

Ms. Ranjeet Kaur. 2014. \u201cConcurrent Access Algorithms for Different Data Structures: A Research Review\u201d. Global Journal of Computer Science and Technology - C: Software & Data Engineering GJCST-C Volume 14 (GJCST Volume 14 Issue C3): .

More Citation Formats

Select Citation Style:

Download Citation

Download Article

GJCST Volume 14 Issue C3
Pg. 1- 9

Explore Journals Explore Volume Read This Issue

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords

compares and swap concurrency elimination lock-free mem- ory management non-blocking

Classification

Not Found

Submission ReceivedDecember 12, 2013
RevisedDecember 12, 2013
Peer Review Double Blind
Handling Editor
Accepted January 5, 2014
Published January 15, 2014

Version of record

v1.2

Issue date

May 27, 2014

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices

Total Score: 107

Country: India

Subject: Global Journal of Computer Science and Technology - C: Software & Data Engineering

Authors: Ms. Ranjeet Kaur, Dr. Pushpa Rani Suri (PhD/Dr. count: 1)

View Count (all-time): 208

Total Views (Real + Logic): 8871

Total Downloads (simulated): 2346

Publish Date: 2014 05, Tue

Monthly Totals (Real + Logic):

Month 1: 50 views
Month 2: 55 views
Month 3: 58 views
Month 4: 22 views
Month 5: 28 views
Month 6: 40 views
Month 7: 29 views
Month 8: 28 views
Month 9: 39 views
Month 10: 17 views
Month 11: 35 views
Month 12: 35 views
Month 13: 21 views
Month 14: 36 views
Month 15: 18 views
Month 16: 19 views
Month 17: 20 views
Month 18: 42 views
Month 19: 21 views
Month 20: 48 views
Month 21: 20 views
Month 22: 35 views
Month 23: 31 views
Month 24: 31 views
Month 25: 35 views
Month 26: 17 views
Month 27: 32 views
Month 28: 42 views
Month 29: 20 views
Month 30: 38 views
Month 31: 45 views
Month 32: 21 views
Month 33: 36 views
Month 34: 28 views
Month 35: 18 views
Month 36: 46 views
Month 37: 13 views
Month 38: 20 views
Month 39: 23 views
Month 40: 33 views
Month 41: 21 views
Month 42: 31 views
Month 43: 33 views
Month 44: 43 views
Month 45: 12 views
Month 46: 38 views
Month 47: 38 views
Month 48: 39 views
Month 49: 28 views
Month 50: 28 views
Month 51: 30 views
Month 52: 27 views
Month 53: 27 views
Month 54: 45 views
Month 55: 14 views
Month 56: 37 views
Month 57: 29 views
Month 58: 47 views
Month 59: 25 views
Month 60: 40 views
Month 61: 24 views
Month 62: 31 views
Month 63: 29 views
Month 64: 34 views
Month 65: 35 views
Month 66: 25 views
Month 67: 29 views
Month 68: 25 views
Month 69: 33 views
Month 70: 27 views
Month 71: 25 views
Month 72: 20 views
Month 73: 31 views
Month 74: 37 views
Month 75: 44 views
Month 76: 21 views
Month 77: 36 views
Month 78: 31 views
Month 79: 38 views
Month 80: 41 views
Month 81: 28 views
Month 82: 14 views
Month 83: 37 views
Month 84: 37 views
Month 85: 32 views
Month 86: 29 views
Month 87: 27 views
Month 88: 27 views
Month 89: 33 views
Month 90: 37 views
Month 91: 34 views
Month 92: 31 views
Month 93: 45 views
Month 94: 30 views
Month 95: 22 views
Month 96: 12 views
Month 97: 27 views
Month 98: 44 views
Month 99: 21 views
Month 100: 30 views
Month 101: 27 views
Month 102: 41 views
Month 103: 33 views
Month 104: 43 views
Month 105: 34 views
Month 106: 37 views
Month 107: 22 views
Month 108: 32 views
Month 109: 43 views
Month 110: 28 views
Month 111: 42 views
Month 112: 29 views
Month 113: 29 views
Month 114: 31 views
Month 115: 29 views
Month 116: 34 views
Month 117: 32 views
Month 118: 35 views
Month 119: 18 views
Month 120: 44 views
Month 121: 21 views
Month 122: 17 views
Month 123: 35 views
Month 124: 42 views
Month 125: 24 views
Month 126: 21 views
Month 127: 45 views
Month 128: 43 views
Month 129: 33 views
Month 130: 34 views
Month 131: 17 views
Month 132: 34 views
Month 133: 34 views
Month 134: 33 views
Month 135: 37 views
Month 136: 17 views
Month 137: 41 views
Month 138: 30 views
Month 139: 27 views
Month 140: 23 views
Month 141: 21 views
Month 142: 41 views
Month 143: 52 views

Total Views: 8871

Total Downloads: 2346

2026 Trends

Research Identity (RIN)

Published Article

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

This Page is Under Development

We are currently updating this article page for a better experience.