This project aims to build on top of our past and ongoing works with Rashmi Vinayak (CMU) and Harsha Madhyastha (Michigan) to address the optimal performance-cost tradeoffs in distributed storage. It's always fun to have the opportunity to be able to work with great friends and colleagues.
Tag Archives: Erasure Coding
EC-Cache Accepted to Appear at OSDI’2016
Update: Camera-ready version is available here now!
In-memory caching is the de facto solution to enable low latency analytics over large datasets. While caching objects, one must be careful about maximizing the number of requests that can be served from memory in the presence of popularity skew, background load imbalance, and server failures. Traditional solutions use selective replication, i.e., … Continue Reading ››