… a concurrent data structure implementation, we need mathematical machinery for specifying
correctness requirements, accurately modeling a concurrent data structure implementation, …

… A concurrent object is a data structure shared by concurrent … in concurrent systems.
Conventional techniques for im- … problem of reasoning about concurrent data structures is reduced …

… We consider one implementation per data structure type, starting from the concurrent algorithm
that has been shown to provide the best performance and scalability [8]. Our linked list is …

… In this section we introduce sketching of concurrent data structures from the … concurrent
operations—the PSKETCH language allows the programmer to express enough of the structure …

… Considering graphs as concurrent data structures, I develop a number of concurrent graph
algorithms in Chapter 4. New algorithms are presented for the shortest path problem, the max-…

… signi cant bene ts over sequential data structures (eg, [19, 27… concurrent data structures for
PIM and we show that naive PIM data structures cannot outperform state-of-the-art concurrent …

… of concurrent data structures. The … the data structure (eg, the sequential behavior of a
concurrent stack is a regular stack). Therefore, relaxing the semantics of a concurrent data structure …

… concurrent data structure is a balancing act between its implementation complexity and
performance. Lock-based concurrent data structures… lock-free concurrent structures allow for high …

… from a given data structure, architecture, performance metric, and workload combination?
In fact, we can provide a practical estimation of an upper bound for a data structure’s scalability…

… of our research lines: concurrent data structures. This type of data structures has attracted a
… In a concurrent implementation of a data structure, a pool of threads modify the contents of …