This paper presents a generic approach for deriving detectably recoverable
implementations of many widely-used concurrent data structures. Such implementations are …

The ring buffer is a staple data structure used in many algorithms and applications. It is
highly desirable in high-demand use cases such as multimedia, network routing, and trading …

Non-blocking algorithms are a class of algorithms that provide guarantees of progress within
a system. These progress guarantees come from the fine-grained synchronization …

We present HUILLY, a non-blocking data ingestion buffer designed for parallel applications
built relying on time-stepped, fork-join computational paradigm. It provides complete data …

We present the tracking approach for deriving detectable implementations of many widely-
used concurrent data structures for systems with non-volatile main memory (NVRAM) …

Dynamic vectors are among the most commonly used data structures in programming. They
provide constant time random access and resizable data storage. Additionally, they provide …

Modern software is often interactive--applications communicate frequently with the external
world. For such applications, responsiveness--how quickly they respond to requests--is as …

The vector is a fundamental data structure, offering constant-time traversal to elements and a
dynamically resizable range of indices. While several concurrent vectors exist, a …

We present the\emph {tracking approach} for deriving\emph {recoverable} implementations
of several widely-used concurrent data structures. Recoverability is appealing for emerging …

In this work, we introduce a novel linearizable wait-free queue implementation.
Linearizability and lock-freedom are standard requirements for designing shared data …