23 citations · 90 across the 7 of their papers we have counts for
7 papers
Adelie: Continuous Address Space Layout Re-randomization for Linux Drivers
Ruslan Nikolaev, Hassan Nadeem, Cathlyn Stone +1
While address space layout randomization (ASLR) has been extensively studied for user-space programs, the corresponding OS kernel's KASLR support remains very limited, making the k…
wCQ: A Fast Wait-Free Queue with Bounded Memory Usage
Ruslan Nikolaev, Binoy Ravindran
The concurrency literature presents a number of approaches for building non-blocking, FIFO, multiple-producer and multiple-consumer (MPMC) queues. However, only a fraction of them…
Crystalline: Fast and Memory Efficient Wait-Free Reclamation
Ruslan Nikolaev, Binoy Ravindran
Historically, memory management based on lock-free reference counting was very inefficient, especially for read-dominated workloads. Thus, approaches such as epoch-based reclamatio…
LibrettOS: A Dynamically Adaptable Multiserver-Library OS
Ruslan Nikolaev, Mincheol Sung, Binoy Ravindran
We present LibrettOS, an OS design that fuses two paradigms to simultaneously address issues of isolation, performance, compatibility, failure recoverability, and run-time upgrades…
Universal Wait-Free Memory Reclamation
Ruslan Nikolaev, Binoy Ravindran
In this paper, we present a universal memory reclamation scheme, Wait-Free Eras (WFE), for deleted memory blocks in wait-free concurrent data structures. WFE's key innovation is th…
A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue
Ruslan Nikolaev
We present a new lock-free multiple-producer and multiple-consumer (MPMC) FIFO queue design which is scalable and, unlike existing high-performant queues, very memory efficient. Mo…
Snapshot-Free, Transparent, and Robust Memory Reclamation for Lock-Free Data Structures
Ruslan Nikolaev, Binoy Ravindran
We present a family of safe memory reclamation schemes, Hyaline, which are fast, scalable, and transparent to the underlying lock-free data structures. Hyaline is based on referenc…