Current hardware and application storage trends put immense pressure on the operating
system's storage subsystem. On the hardware side, the market for storage devices has …

We present TRIAD, a new persistent key-value (KV) store based on Log-Structured Merge
(LSM) trees. TRIAD improves LSM KV throughput by reducing the write amplification arising …

We present a new approach to testing file-system crash consistency: bounded black-box
crash testing (B3). B3 tests the file system in a black-box manner using workloads of file …

Modern datacenters prefer one single filesystem instance that spans the entire datacenter
and supports billions of files. The maintenance of filesystem metadata in such scenarios …

Modern NVMe solid state drives offer significantly higher bandwidth and low latency than
prior storage devices. Current key-value stores struggle to fully utilize the bandwidth of such …

File systems must allocate space for files without knowing what will be added or removed in
the future. Over the life of a file system, this may cause suboptimal file placement decisions …

Key-value (KV) stores based on multi-stage structures are widely deployed in the cloud to
ingest massive amounts of easily searchable user data. However, current KV storage …

B-trees are the go-to data structure for in-memory indexes in databases and storage
systems. B-trees support both point operations (ie, inserts and finds) and range operations …

Key-Value stores provide scalable metadata service for distributed file systems. However,
the metadata's organization itself, which is organized using a directory tree structure, does …

File system performance on modern primary storage devices (Flash-based SSDs) is greatly
affected by aging of the free space, much more so than were mechanical disk drives. We …