K. V. Rashmi

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 49

Top Topics

Distributed Storage

Top Venues

IEEE Trans. Inf. Theory

Publications

Saransh Chopra, Francisco Maturana, K. V. Rashmi
On Low Field Size Constructions of Access-Optimal Convertible Codes. CoRR (2024)
Yazhuo Zhang, Juncheng Yang, Yao Yue, Ymir Vigfusson, K. V. Rashmi
SIEVE is Simpler than LRU: an Efficient Turn-Key Eviction Algorithm for Web Caches. NSDI (2024)
Jiyu Hu, Jack Kosaian, K. V. Rashmi
Rethinking Erasure-Coding Libraries in the Age of Optimized Machine Learning. HotStorage (2024)
Michael Rudow, Francis Y. Yan, Abhishek Kumar, Ganesh Ananthanarayanan, Martin Ellis, K. V. Rashmi
Tambur: Efficient loss recovery for videoconferencing via streaming codes. NSDI (2023)
Michael Rudow, Venkatesan Guruswami, K. V. Rashmi
On expanding the toolkit of locality-based coded computation to the coordinates of inputs. ISIT (2023)
Juncheng Yang, Ziming Mao, Yao Yue, K. V. Rashmi
GL-Cache: Group-level learning for efficient and high-performance caching. FAST (2023)
Francisco Maturana, K. V. Rashmi
Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions. IEEE Trans. Inf. Theory 69 (8) (2023)
Francisco Maturana, K. V. Rashmi
Locally Repairable Convertible Codes: Erasure Codes for Efficient Repair and Conversion. ISIT (2023)
Michael Rudow, Neophytos Charalambides, Alfred O. Hero III, K. V. Rashmi
Compression-Informed Coded Computing. ISIT (2023)
Juncheng Yang, Ziyue Qiu, Yazhuo Zhang, Yao Yue, K. V. Rashmi
FIFO can be Better than LRU: the Power of Lazy Promotion and Quick Demotion. HotOS (2023)
Michael Rudow, K. V. Rashmi
Learning-augmented streaming codes for variable-size messages under partial burst losses. ISIT (2023)
Michael Rudow, K. V. Rashmi
Online Versus Offline Rate in Streaming Codes for Variable-Size Messages. IEEE Trans. Inf. Theory 69 (6) (2023)
Juncheng Yang, Anirudh Sabnis, Daniel S. Berger, K. V. Rashmi, Ramesh K. Sitaraman
C2DN: How to Harness Erasure Codes at the Edge for Efficient Content Delivery. NSDI (2022)
Michael Rudow, K. V. Rashmi
Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size Messages. ISIT (2022)
Michael Rudow, K. V. Rashmi
Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size Messages. CoRR (2022)
Francisco Maturana, K. V. Rashmi
Bandwidth Cost of Code Conversions in the Split Regime. ISIT (2022)
Francisco Maturana, K. V. Rashmi
Convertible Codes: Enabling Efficient Conversion of Coded Data in Distributed Storage. IEEE Trans. Inf. Theory 68 (7) (2022)
Francisco Maturana, K. V. Rashmi
Bandwidth Cost of Code Conversions in the Split Regime. CoRR (2022)
Saurabh Kadekodi, Francisco Maturana, Sanjith Athlur, Arif Merchant, K. V. Rashmi, Gregory R. Ganger
Tiger: Disk-Adaptive Redundancy Without Placement Restrictions. OSDI (2022)
Michael Rudow, K. V. Rashmi
Streaming Codes for Variable-Size Messages. IEEE Trans. Inf. Theory 68 (9) (2022)
Saurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya, Juncheng Yang, K. V. Rashmi, Gregory R. Ganger
PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy. CoRR (2021)
Jack Kosaian, K. V. Rashmi
Arithmetic-intensity-guided fault tolerance for neural network inference on GPUs. SC (2021)
Kaige Liu, Jack Kosaian, K. V. Rashmi
ECRM: Efficient Fault Tolerance for Recommendation Model Training via Erasure Coding. CoRR (2021)
Jack Kosaian, K. V. Rashmi
Arithmetic-Intensity-Guided Fault Tolerance for Neural Network Inference on GPUs. CoRR (2021)
Francisco Maturana, K. V. Rashmi
Irregular Array Codes with Arbitrary Access Sets for Geo-Distributed Storage. ISIT (2021)
Juncheng Yang, Yao Yue, K. V. Rashmi
A Large-scale Analysis of Hundreds of In-memory Key-value Cache Clusters at Twitter. ACM Trans. Storage 17 (3) (2021)
Michael Rudow, K. V. Rashmi, Venkatesan Guruswami
A locality-based lens for coded computation. ISIT (2021)
Francisco Maturana, K. V. Rashmi
Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions. ISIT (2021)
Francisco Maturana, K. V. Rashmi
Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions. CoRR (2020)
Michael Rudow, K. V. Rashmi
Online Versus Offline Rate in Streaming Codes for Variable-Size Messages. CoRR (2020)
Juncheng Yang, Yao Yue, K. V. Rashmi
A large scale analysis of hundreds of in-memory cache clusters at Twitter. OSDI (2020)
Francisco Maturana, V. S. Chaitanya Mukka, K. V. Rashmi
Access-optimal Linear MDS Convertible Codes for All Parameters. ISIT (2020)
Saurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya, Juncheng Yang, K. V. Rashmi, Gregory R. Ganger
PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy. OSDI (2020)
Michael Rudow, K. V. Rashmi
Online Versus Offline Rate in Streaming Codes for Variable-Size Messages. ISIT (2020)
Francisco Maturana, V. S. Chaitanya Mukka, K. V. Rashmi
Access-optimal Linear MDS Convertible Codes for All Parameters. CoRR (2020)
Michael Rudow, K. V. Rashmi, Venkatesan Guruswami
A locality-based approach for coded computation. CoRR (2020)
Jack Kosaian, K. V. Rashmi, Shivaram Venkataraman
Learning-Based Coded Computation. IEEE J. Sel. Areas Inf. Theory 1 (1) (2020)
Francisco Maturana, K. V. Rashmi
Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed Storage. ITCS (2020)
Jack Kosaian, K. V. Rashmi, Shivaram Venkataraman
Parity Models: A General Framework for Coding-Based Resilience in ML Inference. CoRR (2019)
Saurabh Kadekodi, K. V. Rashmi, Gregory R. Ganger
Cluster storage systems gotta have HeART: improving storage efficiency by exploiting disk-reliability heterogeneity. FAST (2019)
Jack Kosaian, K. V. Rashmi, Shivaram Venkataraman
Parity models: erasure-coded resilience for prediction serving systems. SOSP (2019)
Francisco Maturana, K. V. Rashmi
Convertible Codes: Efficient Conversion of Coded Data in Distributed Storage. CoRR (2019)
Devdeep Ray, Jack Kosaian, K. V. Rashmi, Srinivasan Seshan
Vantage: optimizing video upload for time-shifted viewing of social live streams. SIGCOMM (2019)
Jack Kosaian, K. V. Rashmi, Shivaram Venkataraman
Learning a Code: Machine Learning for Approximate Non-Linear Coded Computation. CoRR (2018)
Michael Rudow, K. V. Rashmi
Streaming Codes For Variable-Size Arrivals. Allerton (2018)
K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar
Information-Theoretically Secure Erasure Codes for Distributed Storage. IEEE Trans. Inf. Theory 64 (3) (2018)
K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran
A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes. IEEE Trans. Inf. Theory 63 (9) (2017)
Preetum Nakkiran, K. V. Rashmi, Kannan Ramchandran
Optimal systematic distributed storage codes with fast encoding. ISIT (2016)
K. V. Rashmi, Mosharaf Chowdhury, Jack Kosaian, Ion Stoica, Kannan Ramchandran
EC-Cache: Load-Balanced, Low-Latency Cluster Caching with Online Erasure Coding. OSDI (2016)
K. V. Rashmi, Preetum Nakkiran, Jingyan Wang, Nihar B. Shah, Kannan Ramchandran
Having Your Cake and Eating It Too: Jointly Optimal Erasure Codes for I/O, Storage, and Network-bandwidth. FAST (2015)
Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran, P. Vijay Kumar
Information-theoretically Secure Erasure Codes for Distributed Storage. CoRR (2015)
Preetum Nakkiran, K. V. Rashmi, Kannan Ramchandran
Optimal Systematic Distributed Storage Codes with Fast Encoding. CoRR (2015)
Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran
Distributed Secret Dissemination Across a Network. IEEE J. Sel. Top. Signal Process. 9 (7) (2015)
K. V. Rashmi, Ran Gilad-Bachrach
DART: Dropouts meet Multiple Additive Regression Trees. CoRR (2015)
Birenjith Sasidharan, P. Vijay Kumar, Nihar B. Shah, K. V. Rashmi, K. Ramachandran
Optimality of the product-matrix construction for secure MSR regenerating codes. ISCCSP (2014)
Preetum Nakkiran, Nihar B. Shah, K. V. Rashmi
Fundamental limits on communication for oblivious updates in storage networks. GLOBECOM (2014)
K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, Kannan Ramchandran
A "hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers. SIGCOMM (2014)
Preetum Nakkiran, Nihar B. Shah, K. V. Rashmi
Fundamental Limits on Communication for Oblivious Updates in Storage Networks. CoRR (2014)
Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran
One extra bit of download ensures perfectly private information retrieval. ISIT (2014)
K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, Kannan Ramchandran
A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster. CoRR (2013)
Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran
Secure network coding for distributed secret sharing with low communication cost. ISIT (2013)
K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, Kannan Ramchandran
A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster. HotStorage (2013)
K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran
A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes CoRR (2013)
K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran
A piggybacking design framework for read-and download-efficient distributed storage codes. ISIT (2013)
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran
Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions. IEEE Trans. Inf. Theory 58 (4) (2012)
Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran
Secret Share Dissemination across a Network CoRR (2012)
K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar
Regenerating Codes for Errors and Erasures in Distributed Storage CoRR (2012)
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran
Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff. IEEE Trans. Inf. Theory 58 (3) (2012)
K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar
Regenerating codes for errors and erasures in distributed storage. ISIT (2012)
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar
Information-theoretically Secure Regenerating Codes for Distributed Storage CoRR (2011)
K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar
Enabling Node Repair in Any Erasure Code for Distributed Storage CoRR (2011)
K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar
Enabling node repair in any erasure code for distributed storage. ISIT (2011)
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar
Information-Theoretically Secure Regenerating Codes for Distributed Storage. GLOBECOM (2011)
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran
Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff CoRR (2010)
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran
The MISER Code: An MDS Distributed Storage Code that Minimizes Repair Bandwidth for Systematic Nodes through Interference Alignment CoRR (2010)
K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran
Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storage. ISIT (2010)
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar
A flexible class of regenerating codes for distributed storage. ISIT (2010)
K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction CoRR (2010)
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran
Regenerating Codes for Distributed Storage Networks. WAIFI (2010)
K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran
Explicit and optimal codes for distributed storage. ITA (2010)
K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran
Exact Regenerating Codes for Distributed Storage CoRR (2009)
K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran
Explicit construction of optimal exact regenerating codes for distributed storage. Allerton (2009)
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran
Explicit Codes Minimizing Repair Bandwidth for Distributed Storage CoRR (2009)