Concurrent data structure (original) (raw)

In computer science, a concurrent data structure is aparticular way of storing and organizing data for access bymultiple computing threads (or processes) on a computer. Historically, such data structures were used on uniprocessormachines with operating systems that supported multiplecomputing threads (or processes). The term concurrency captured themultiplexing/interleaving of the threads' operations on thedata by the operating system, even though the processors neverissued two operations that accessed the data simultaneously.