Keyword

concurrent data structures

Description: Data organization methods designed to support safe access and modification by multiple threads or processes simultaneously.

Primary topic: Distributed systems and fault tolerance (54%)

Wikidata ID: wiki/Q5159104

OpenAlex ID: keywords/concurrent-data-structures

Actors: A Model of Concurrent Computation in Distributed Systems

1986 · Gul Agha · DSpace@MIT (Massachusetts Institute of Technology) · 2,223

PDF

A dichromatic framework for balanced trees

1978 · Leo J. Guibas, Robert Sedgewick · Annual Symposium on Foundations of Computer Science · 674

McRT-STM

2006 · Bratin Saha, Ali-Reza Adl-Tabatabai, et al. · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · 490

Java Concurrency in Practice

2006 · Tim Peierls, Brian Goetz, et al. · Medical Entomology and Zoology · 403

FPTree

2016 · Ismail Oukid, Johan Lasperas, et al. · Proceedings - ACM-SIGMOD International Conference on Management of Data · 316

Transactional boosting

2008 · Maurice Herlihy, Eric Koskinen · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · 305

Mathematizing C++ concurrency

2011 · Mark Batty, Scott Owens, et al. · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 284

Fast randomized consensus using shared memory

1990 · James Aspnes, Maurice Herlihy · Journal of Algorithms · 254

Program sketching

2012 · Armando Solar-Lezama · International Journal on Software Tools for Technology Transfer · 227

CheckFence

2007 · Sebastian Burckhardt, Rajeev Alur, et al. · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 226

Removing unnecessary synchronization in Java

1999 · Jeff Bogda, Urs Hölzle · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · 210

Concurrent manipulation of binary search trees

1980 · H. T. Kung, Philip L. Lehman · ACM Transactions on Database Systems · 198

Sketching concurrent data structures

2008 · Armando Solar-Lezama, Christopher Grant Jones, et al. · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 195

Impossibility and universality results for wait-free synchronization

1988 · Maurice P. Herlihy · ACM Symposium on Principles of Distributed Computing (PODC) · 192

PDF

Non-blocking binary search trees

2010 · Faith Ellen, Panagiota Fatourou, et al. · 190

A VLSI architecture for concurrent data structures

1988 · Dally, William James · Microprocessors and Microsystems · 181

The Art of Multiprocessor Programming, Revised Reprint

2012 · Maurice Herlihy, Nir Shavit · DIAL (Catholic University of Leuven) · 168

Recipe

2019 · Se Kwon Lee, Jayashree Mohan, et al. · 162

PDF

A methodology for implementing highly concurrent data structures

1990 · M. Herlihy · ACM SIGPLAN Notices · 162

Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model

2016 · Joseph Izraelevitz, Hammurabi Mendes, et al. · Lecture notes in computer science · 156

Performance of memory reclamation for lockless synchronization

2007 · Thomas E. Hart, Paul E. McKenney, et al. · Journal of Parallel and Distributed Computing · 152

Real‐Time Concurrent Linked List Construction on the GPU

2010 · Jason C. Yang, Justin Hensley, et al. · Computer Graphics Forum · 151

Modular fine-grained concurrency verification

2021 · Viktor Vafeiadis · 147

Fast concurrent queues for x86 processors

2013 · Adam Morrison, Yehuda Afek · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · 146

Lock-free linked lists and skip lists

2004 · Mikhail Fomitchev, Eric Ruppert · ACM Symposium on Principles of Distributed Computing (PODC) · 145

Works count: 1,669

Citation count: 22,290