Publications (37)
TinyLFU: A Highly Efficient Cache Admission Policy
Gil Einziger, Roy Friedman, Ben Manes
This paper proposes to use a frequency based cache admission policy in order to boost the effectiveness of caches subject to skewed access distributions. Given a newly accessed ite…
Distributed Recoverable Sketches (Extended Version)
Diana Cohen, Roy Friedman, Rana Shahout
Sketches are commonly used in computer systems and network monitoring tools to provide efficient query executions while maintaining a compact data representation. Switches and rout…
Lightweight Robust Size Aware Cache Management
Gil Einziger, Ohad Eytan, Roy Friedman +1
Modern key-value stores, object stores, Internet proxy caches, as well as Content Delivery Networks (CDN) often manage objects of diverse sizes, e.g., blobs, video files of differe…
COARA: Code Offloading on Android with AspectJ
Roy Friedman, Nir Hauser
Smartphones suffer from limited computational capabilities and battery life. A method to mitigate these problems is code offloading: executing application code on a remote server.…
A Generic Efficient Biased Optimizer for Consensus Protocols
Yehonatan Buchnik, Roy Friedman
Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in partic…
Heavy Hitters over Interval Queries
Ran Ben Basat, Roy Friedman, Rana Shahout
Heavy hitters and frequency measurements are fundamental in many networking applications such as load balancing, QoS, and network security. This paper considers a generalized slidi…