Motivation General-purpose processors can now contain many dozens of processor cores
and support hundreds of simultaneous threads of execution. To make best use of these …

App stores like Google Play and Apple AppStore have over 3 Million apps covering nearly
every kind of software and service. Billions of users regularly download, use, and review …

Due to data spreading among processors and due to the cache coherence problem, private
data caches have not been as effective in reducing the average memory delay in …

A shared data structure is lock-free if its operations do not require mutual exclusion. If one
process is interrupted in the middle of an operation, other processes will not be prevented …

Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in
shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting …

As we learn from the literature, flexibility in choosing synchroni~ ation operations greatly
simplifies the task of designing highly concurrent programs. Unfortunately, existing hardware …

Drawing ideas from previous authors, we present a new non-blocking concurrent queue
algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can …

Virtual machines in the cloud typically run existing general-purpose operating systems such
as Linux. We notice that the cloud's hypervisor already provides some features, such as …

This paper presents the most exhaustive study of synchronization to date. We span multiple
layers, from hardware cache-coherence protocols up to high-level concurrent software. We …

A concurrent object is a data structure shared by concurrent processes. Conventional
techniques for implementing concurrent objects typically rely on critical sections; ensuring …