research
∙
09/06/2023
An Evaluation of Software Sketches
This work presents a detailed evaluation of Rust (software) implementati...
share
research
∙
06/27/2022
Multilevel Bidirectional Cache Filter
Modern caches are often required to handle a massive amount of data, whi...
research
∙
03/09/2022
Limited Associativity Caching in the Data Plane
In-network caching promises to improve the performance of networked and ...
research
∙
01/06/2022
SQUAD: Combining Sketching and Sampling Is Better than Either for Per-item Quantile Estimation
Stream monitoring is fundamental in many data stream applications, such ...
research
∙
07/27/2021
On the data persistency of replicated erasure codes in distributed storage systems
This paper studies the fundamental problem of data persistency for a gen...
research
∙
07/19/2021
Limited Associativity Makes Concurrent Software Caches a Breeze
Software caches optimize the performance of diverse storage systems, dat...
research
∙
05/18/2021
Lightweight Robust Size Aware Cache Management
Modern key-value stores, object stores, Internet proxy caches, as well a...
research
∙
04/20/2021
Posterior Sampling for Image Restoration using Explicit Patch Priors
Almost all existing methods for image restoration are based on optimizin...
research
∙
03/25/2021
Accelerating Big-Data Sorting Through Programmable Switches
Sorting is a fundamental and well studied problem that has been studied ...
research
∙
10/27/2020
Jiffy: A Fast, Memory Efficient, Wait-Free Multi-Producers Single-Consumer Queue
In applications such as sharded data processing systems, sharded in-memo...
research
∙
08/07/2019
A Generic Efficient Biased Optimizer for Consensus Protocols
Consensus is one of the most fundamental distributed computing problems....
research
∙
01/10/2019
TOY: a Total ordering Optimistic sYstem for Permissioned Blockchains
Blockchains are distributed secure ledgers to which transactions are iss...
research
∙
04/28/2018
Heavy Hitters over Interval Queries
Heavy hitters and frequency measurements are fundamental in many network...
research
∙
12/05/2017
Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free
For many networking applications, recent data is more significant than o...
research
∙
12/02/2015
