Neil Kaushikkar
Research Subjects
Neil Kaushikkar has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Aishwarya Ganesan
University of Illinois Urbana-Champaign, Urbana, IL, USA
1 shared publication - Henry Zhu
University of Illinois Urbana-Champaign, Champaign, Illinois, USA
1 shared publication - Kiran Hombal
University of Illinois Urbana-Champaign, Urbana, USA
1 shared publication - Ramnatthan Alagappan
University of Illinois Urbana-Champaign, Urbana, IL, USA
1 shared publication - Shreesha Gopalakrishna Bhat
University of Illinois Urbana-Champaign, Urbana, IL, USA
1 shared publication
Latest Publications
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1381-1398
A Logically Disaggregated Cache for Replicated Storage Systems
We study if replicated storage systems effectively utilize the caches embedded within each replica. Our study reveals that existing systems manage the embedded caches in each replica in silos, leading to significant cache redundancy across replicas and consequently low performance. To address this problem, we introduce logically disaggregated cache (Ldc), a new approach to managing caches in replicated storage systems. Ldc disaggregates the embedded caches from the replicas to form a single, logical cache. Ldc then allows any replica to access any part of the logical cache, which reduces redundancy caused by reads. Because writes pollute all caches, Ldc quickly demotes written objects to limit redundancy caused by writes. Ldc, however, realizes that reducing redundancy may hurt performance in some cases and thus employs an online analyzer to strike a balance between cache redundancy and coverage. We implement Ldc in three systems: an eventually-consistent KV store, a strongly-consistent KV store, and a production database. Using microbenchmarks, macrobenchmarks, and real-world traces, we show that the Ldc versions perform significantly better than the original systems (e.g., 2.6× to 5.4× higher throughput in the eventually-consistent KV store under YCSB).
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1381-1398
Open AccessA Logically Disaggregated Cache for Replicated Storage Systems
We study if replicated storage systems effectively utilize the caches embedded within each replica. Our study reveals that existing systems manage the embedded caches in each replica in silos, leading to significant cache redundancy across replicas and consequently low performance. To address this problem, we introduce logically disaggregated cache (Ldc), a new approach to managing caches in replicated storage systems. Ldc disaggregates the embedded caches from the replicas to form a single, logical cache. Ldc then allows any replica to access any part of the logical cache, which reduces redundancy caused by reads. Because writes pollute all caches, Ldc quickly demotes written objects to limit redundancy caused by writes. Ldc, however, realizes that reducing redundancy may hurt performance in some cases and thus employs an online analyzer to strike a balance between cache redundancy and coverage. We implement Ldc in three systems: an eventually-consistent KV store, a strongly-consistent KV store, and a production database. Using microbenchmarks, macrobenchmarks, and real-world traces, we show that the Ldc versions perform significantly better than the original systems (e.g., 2.6× to 5.4× higher throughput in the eventually-consistent KV store under YCSB).