As a cache eviction algorithm, FIFO has a lot of attractive properties, such as simplicity,
speed, scalability, and flash-friendliness. The most prominent criticism of FIFO is its low …

Distributed in-memory key-value (KV) stores are embracing the disaggregated memory (DM)
architecture for higher resource utilization. However, existing KV stores on DM employ …

Caching is an indispensable technique for low-cost and fast data serving. The eviction
algorithm, at the heart of a cache, has been primarily designed to maximize efficiency …

Data serialization is critical for many datacenter applications, but the memory copies
required to move application data into packets are costly. Recent zero-copy APIs expose …

High performance distributed storage systems face the challenge of load imbalance caused
by skewed and dynamic workloads. This paper introduces Pegasus, a new storage system …

The ability to safely extend OS kernel functionality is a longstanding goal in OS design, with
the widespread use of the eBPF framework in Linux and Windows demonstrating the …

Many social-media and IoT services have very large working sets consisting of billions of
tiny (≈ 100 B) objects. Large, flash-based caches are important to serving these working …

Web applications rely heavily on software caches to achieve low-latency, high-throughput
services. To adapt to changing workloads, three types of learned caches (learned evictions) …

We present Nap, a black-box approach that converts concurrent persistent memory (PM)
indexes into NUMA-aware counterparts. Based on the observation that real-world workloads …

Modern key-value (KV) stores adopt the LSM-tree as the core data structure for managing
KV pairs, but suffer from high write and read amplifications. Existing LSM-tree optimizations …