This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Concurrent data structure" – news · newspapers · books · scholar · JSTOR(November 2009) (Learn how and when to remove this message)
In computer science, a concurrent data structure is a
particular way of storing and organizing data for access by
multiple computing threads (or processes) on a computer.
Historically, such data structures were used on uniprocessor
machines with operating systems that supported multiple
computing threads (or processes). The term concurrency captured the
multiplexing/interleaving of the threads' operations on the
data by the operating system, even though the processors never
issued two operations that accessed the data simultaneously.
Today, as multiprocessor computer architectures that provide
parallelism become the dominant computing platform (through the
proliferation of multi-core processors), the term has come to
stand mainly for data structures that can be accessed by multiple
threads which may actually access the data simultaneously because
they run on different processors that communicate with one another.
The concurrent data structure (sometimes also called a shared data structure) is usually considered to reside in an abstract storage
environment called shared memory, though this memory may be
physically implemented as either a "tightly coupled" or a
distributed collection of storage modules.
and 24 Related for: Concurrent data structure information
In computer science, a concurrentdatastructure is a particular way of storing and organizing data for access by multiple computing threads (or processes)...
Abstract data type ConcurrentdatastructureData model Dynamization Linked datastructure List of datastructures Persistent datastructure Plain old data structure...
In computing, a persistent datastructure or not ephemeral datastructure is a datastructure that always preserves the previous version of itself when...
first known concurrentdata-structure that supports O(1), atomic, lock-free snapshots. The Ctrie datastructure is a non-blocking concurrent hash array...
threads using a hash function. Concurrent hash tables represent a key concurrentdatastructure for use in concurrent computing which allow multiple threads...
an active data structure is associated with a computing resource, which contains one or more concurrently executing processes, and data associated with...
property that provides guarantees in the concurrent accesses to data. Isolation is implemented by means of a concurrency control protocol. The simplest way...
interrupted. Entry to a critical section restricts concurrentdatastructure access. When a datastructure must be accessed by an interrupt handler, the critical...
Structured Query Language (SQL) (pronounced S-Q-L; historically "sequel") is a domain-specific language used to manage data, especially in a relational...
operations be seen in the order in which they were actually issued. Concurrentdatastructure Linearizability Serializability Leslie Lamport, "How to Make a...
database concurrently. As such, it needs to control concurrent access to shared data, to ensure data integrity—when multiple clients update the same data, or...
system as a whole will. A concurrent system consists of a collection of processes communicating through shared datastructures or objects. Linearizability...
circuit Quiescent consistency is one of the safety properties for concurrentdatastructures Rest (disambiguation) This disambiguation page lists articles...
include reference counting. Concurrentdatastructure Hazard (computer architecture) Finalizer Anthony Williams. C++ Concurrency in Action: Practical Multithreading...
Concurrent computing is a form of computing in which several computations are executed concurrently—during overlapping time periods—instead of sequentially—with...
sensitive data, and distributed computing issues, including supporting concurrent access and fault tolerance. Computer scientists may classify database...
such as a datastructure, peripheral device, or network connection, that would not operate correctly in the context of multiple concurrent accesses. Different...
DOS in 1992, the three master value-added resellers (VARs) DataPac Australasia, Concurrent Controls and Intelligent Micro Software were allowed to take...
clock. It uses CRCW memory; m[i] <= 1 and maxNo <= data[i] are written concurrently. The concurrency causes no conflicts because the algorithm guarantees...
Clojure's syntax is built on S-expressions that are first parsed into datastructures by a reader before being compiled. Clojure's reader supports literal...
intelligent methods) from a data set and transforming the information into a comprehensible structure for further use. Data mining is the analysis step...
In computer science, a skip list (or skiplist) is a probabilistic datastructure that allows O ( log n ) {\displaystyle O(\log n)} average complexity...