Live briefing
Everything about Concurrent data structure
Data structure that can be used by multiple threads
In computer science, a concurrent data structure is a data structure designed for access and modification by multiple computing threads on a computer, for example concurrent queues, concurrent stacks etc. The concurrent data structure is typically considered to reside in an abstract storage environment known as shared memory, which may be physically implemented as either a tightly coupled or a distributed collection of storage modules. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Concurrent data structureA 5-minute orientation
- Skim a recent paper: Data‐driven concurrent nanostructure optimization based on conditional generative adversarial networksInfluential work since 2022
- Pick up a classic book: Computer-aided materials selection during structural designThe most-reprinted book on the subject
- Read the landmark paper: Polylogarithmic concurrent data structures from monotone circuitsCited 34 times
- Go sideways: Lock (computer science)A closely related topic
- Go sideways: Non-blocking algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Polylogarithmic concurrent data structures from monotone circuits
Verifying Concurrent Data Structures by Simulation
Quantitative relaxation of concurrent data structures
Sketching concurrent data structures
An efficient multipath structure for concurrent data transport in wireless mesh networks
Black-box Concurrent Data Structures for NUMA Architectures
Skip trees, an alternative data structure to skip lists in a concurrent approach
Data visualization: Concurrent computation and data visualization for spherical-virus structure determination
🆕 Influential since 2022
Data‐driven concurrent nanostructure optimization based on conditional generative adversarial networks
TransformerLSR: Attentive joint model of longitudinal data, survival, and recurrent events with concurrent latent structure
Concurrent Data Structures Made Easy
Automated Robustness Verification of Concurrent Data Structure Libraries against Relaxed Memory Models
Elastic Relaxation of Concurrent Data Structures
📚 Books worth reading
Computer-aided materials selection during structural designNational Research Council Staff, Joyce L. Vedral · 1995
The concurrency control problem for database systemsMarco Antonio Casanova · 1981
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Lock (computer science) In computer science, a lock or mutex (from mutual exclusion) is a synchronization primitive that prevents state from being modified or accessed by multiple…
- Non-blocking algorithm In computer science, an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread; for…
- Synchronization (computer science) In computer science, synchronization is the task of coordinating multiple processes to join up or handshake at a certain point, in order to reach an agreement…
- Concurrent computing Concurrent computing is a form of computing in which several computations are executed concurrently—during overlapping time periods, instead of sequentially—wit…
- Readers–writer lock In computer science, a readers–writer (single-writer lock, a multi-reader lock, a push lock, or an MRSW lock) is a synchronization primitive that solves…
- Concurrent hash table A concurrent hash table or concurrent hash map is an implementation of hash tables allowing concurrent access by multiple threads using a hash function…
- Threading Building Blocks oneAPI Threading Building Blocks (oneTBB; formerly Threading Building Blocks or TBB) is a C++ template library developed by Intel for parallel programming…
- Semaphore (programming) In computer science, a semaphore is a synchronization device used to control access to a common resource by multiple threads or processes in a concurrent…