We introduce" asynchronized concurrency (ASCY)," a paradigm consisting of four
complementary programming patterns. ASCY calls for the design of concurrent search data …

Achieving high performance for concurrent applications on modern multiprocessors remains
challenging. Many programmers avoid locking to improve performance, while others replace …

Memory reclamation for sequential or lock-based data structures is typically easy. However,
memory reclamation for lock-free data structures is a significant challenge. Automatic …

In this paper we present interval-based reclamation (IBR), a new approach to safe
reclamation of disconnected memory blocks in nonblocking concurrent data structures. Safe …

We introduce Perceus, an algorithm for precise reference counting with reuse and
specialization. Starting from a functional core language with explicit control-flow, Perceus …

Historically, memory management based on lock-free reference counting was very
inefficient, especially for read-dominated workloads. Thus, approaches such as epoch …

For non-blocking data-structures, only memory reclamation with pointer-based techniques
can maintain non-blocking progress, but there can be high overhead associated to these …

The inherently large and varying volumes of information generated in large scale systems
demand near real-time processing of data streams. In this context, data streaming is …

Safe memory reclamation (SMR) algorithms suffer from a trade-off between bounding
unreclaimed memory and the speed of reclamation. Hazard pointer (HP) based algorithms …

The concurrent memory reclamation problem is that of devising a way for a deallocating
thread to verify that no other concurrent threads hold references to a memory block being …