Concurrent Access Algorithms for Different Data Structures: A Research Review

α
Ms. Ranjeet Kaur
Ms. Ranjeet Kaur
σ
Dr. Pushpa Rani Suri
Dr. Pushpa Rani Suri
α Kurukshetra University

Send Message

To: Author

Concurrent Access Algorithms for Different Data Structures: A Research Review

Article Fingerprint

ReserarchID

CSTSDEG7PM7

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

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

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.

References

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

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.

How to Cite 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): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Version of record

v1.2

Issue date

May 27, 2014

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 8934
Total Downloads: 2308
2026 Trends
Related Research

Published Article

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.

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]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Concurrent Access Algorithms for Different Data Structures: A Research Review

Ms. Ranjeet Kaur
Ms. Ranjeet Kaur Kurukshetra University
Dr. Pushpa Rani Suri
Dr. Pushpa Rani Suri

Research Journals