Projects

analytical modeling

TTL Approximations for a Family of CLOCK-Like Cache Replacement Policies

We extend TTL approximations to a family of CLOCK-like cache policies and adapt van den Berg and Towsley’s Schur-convexity proof for the FIFO miss ratio, establishing Schur-concavity results for CLOCK. This helps explain why FIFO outperforms RANDOM on real workloads and why CLOCK often outperforms LRU."

Performance Analysis of the Randomized SIEVE/CLOCK Cache Replacement Algorithm

We introduce a randomized version of the SIEVE/CLOCK algorithm that uses ⌈log2(K+1)⌉ ≥ 1 access bits per cached item, and present a heterogeneous mean-field approximation of its performance."

microbenchmarks

Configurable and Cache-Accurate Trace Generation for Storage Benchmarking

2DIO is a configurable I/O trace generator capable of producing cache-accurate workloads with tunable performance cliffs and plateaus.

A library for cache simulation

This package implements a novel algorithm for the LRU cache eviction policy using a fixed-size array.

Generating high-fidelity I/O traces with GAN

Reproduction of LSTM-based GAN synthetic I/O generation proposed by Zhang et al. (2024).

distributed systems

QoS, Fairness and Isolation in One Formula

A unified linear programming formula for optimal per-VM IOPS allocation under QoS and device constraints.

A Distributed Object Store built on Conventional File System

This is an emulation of a distributed store system built on Zoned Namespace SSDs. The system guarantees strong consistency and fault tolerant.