Lock-free objects offer significant performance and reliability advantages over conventional
lock-based objects. However, the lack of an efficient portable lock-free method for the …

We propose a new form of software transactional memory (STM) designed to support
dynamic-sized data structures, and we describe a novel non-blocking implementation. The …

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 …

The literature describes two high performance concurrent stack algorithms based on
combining funnels and elimination trees. Unfortunately, the funnels are linearizable but …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

This paper is motivated by the difficulty in writing correct high-performance programs. Writing
shared-memory multi-threaded programs imposes a complex trade-off between …

We present the first lock-free implementation of an extensible hash table running on current
architectures. Our algorithm provides concurrent insert, delete, and find operations with an …

In this paper, we address an open problem of zero-shot learning. Its principle is based on
learning a map** that associates feature vectors extracted from ie images and attribute …

Weak memory models formalize the inconsistent behaviors that one can expect to observe
in multithreaded programs running on modern hardware. In so doing, however, they …

Low overhead core-to-core communication is critical for efficient pipeline-parallel software
applications. This paper presents FastForward, a cache-optimized single-producer/single …