Concurrent libraries with foresight

TL;DR: A simple static analysis algorithm is implemented that conservatively verifies linearizabilty of encapsulated extensions of Java concurrent maps and empirical results illustrating the benefits of the reduction theorems are presented.

TL;DR: In this paper, a compiler takes as input a program written using concurrent relations and synthesizes a representation of the relations as sets of cooperating data structures as well as the placement and acquisition of locks to synchronize concurrent access to those data structures.

TL;DR: It is proved that corrective synchronization is serializable and give conditions under which progress is ensured, and early encouraging results that the approach competes with or out-performs previous pessimistic or optimistic approaches.

TL;DR: This paper presents Automatic Semantic Locking, a novel concurrency control approach that uses ADT-specific semantic locking operations to atomically execute code fragments without deadlocks or rollbacks, enabling efficient and scalable synchronization in concurrent programs.

TL;DR: This paper defines linearizability, compares it to other correctness conditions, presents and demonstrates a method for proving the correctness of implementations, and shows how to reason about concurrent objects, given they are linearizable.

TL;DR: Several efficiently recognizable subclasses of the class of senahzable histories are introduced and it is shown how these results can be extended to far more general transaction models, to transactions with partly interpreted functions, and to distributed database systems.

TL;DR: Experiments on a 12-node SGI Challenge multiprocessor indicate that the new non-blocking queue consistently outperforms the best known alternatives; it is the clear algorithm of choice for machines that provide a universal atomic primitive (e.g., compare_and_swap or load_linked/store_conditional).

TL;DR: The problem of the mutual exclusion of several independent processes from simultaneous access to a “critical section” is discussed for the case where there are two distinct classes of processes known as “readers” and “writers.”