K. V. Rashmi

According to our database, K. V. Rashmi authored at least 67 papers between 2009 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions.

Francisco Maturana, K. V. Rashmi

IEEE Trans. Inf. Theory, August, 2023

Online Versus Offline Rate in Streaming Codes for Variable-Size Messages.

Michael Rudow, K. V. Rashmi

IEEE Trans. Inf. Theory, June, 2023

Efficient Fault Tolerance for Recommendation Model Training via Erasure Coding.

Tianyu Zhang, Kaige Liu, Jack Kosaian, Juncheng Yang, Rashmi Vinayak

Proc. VLDB Endow., 2023

FIFO queues are all you need for cache eviction.

Juncheng Yang, Yazhuo Zhang, Ziyue Qiu, Yao Yue, Rashmi Vinayak

Proceedings of the 29th Symposium on Operating Systems Principles, 2023

Tambur: Efficient loss recovery for videoconferencing via streaming codes.

Michael Rudow, Francis Y. Yan, Abhishek Kumar, Ganesh Ananthanarayanan, Martin Ellis, K. V. Rashmi

Proceedings of the 20th USENIX Symposium on Networked Systems Design and Implementation, 2023

Learning-augmented streaming codes for variable-size messages under partial burst losses.

Michael Rudow, K. V. Rashmi

Proceedings of the IEEE International Symposium on Information Theory, 2023

On expanding the toolkit of locality-based coded computation to the coordinates of inputs.

Michael Rudow, Venkatesan Guruswami, K. V. Rashmi

Proceedings of the IEEE International Symposium on Information Theory, 2023

Compression-Informed Coded Computing.

Michael Rudow, Neophytos Charalambides, Alfred O. Hero III, K. V. Rashmi

Proceedings of the IEEE International Symposium on Information Theory, 2023

Locally Repairable Convertible Codes: Erasure Codes for Efficient Repair and Conversion.

Francisco Maturana, K. V. Rashmi

Proceedings of the IEEE International Symposium on Information Theory, 2023

FIFO can be Better than LRU: the Power of Lazy Promotion and Quick Demotion.

Juncheng Yang, Ziyue Qiu, Yazhuo Zhang, Yao Yue, K. V. Rashmi

Proceedings of the 19th Workshop on Hot Topics in Operating Systems, 2023

GL-Cache: Group-level learning for efficient and high-performance caching.

Juncheng Yang, Ziming Mao, Yao Yue, K. V. Rashmi

Proceedings of the 21st USENIX Conference on File and Storage Technologies, 2023

2022

Streaming Codes for Variable-Size Messages.

Michael Rudow, K. V. Rashmi

IEEE Trans. Inf. Theory, 2022

Convertible Codes: Enabling Efficient Conversion of Coded Data in Distributed Storage.

Francisco Maturana, K. V. Rashmi

IEEE Trans. Inf. Theory, 2022

Tiger: Disk-Adaptive Redundancy Without Placement Restrictions.

Saurabh Kadekodi, Francisco Maturana, Sanjith Athlur, Arif Merchant, K. V. Rashmi, Gregory R. Ganger

Proceedings of the 16th USENIX Symposium on Operating Systems Design and Implementation, 2022

C2DN: How to Harness Erasure Codes at the Edge for Efficient Content Delivery.

Juncheng Yang, Anirudh Sabnis, Daniel S. Berger, K. V. Rashmi, Ramesh K. Sitaraman

Proceedings of the 19th USENIX Symposium on Networked Systems Design and Implementation, 2022

Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size Messages.

Michael Rudow, K. V. Rashmi

Proceedings of the IEEE International Symposium on Information Theory, 2022

Bandwidth Cost of Code Conversions in the Split Regime.

Francisco Maturana, K. V. Rashmi

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

A Large-scale Analysis of Hundreds of In-memory Key-value Cache Clusters at Twitter.

Juncheng Yang, Yao Yue, K. V. Rashmi

ACM Trans. Storage, 2021

ECRM: Efficient Fault Tolerance for Recommendation Model Training via Erasure Coding.

Kaige Liu, Jack Kosaian, K. V. Rashmi

CoRR, 2021

Arithmetic-intensity-guided fault tolerance for neural network inference on GPUs.

Jack Kosaian, K. V. Rashmi

Proceedings of the International Conference for High Performance Computing, 2021

Segcache: a memory-efficient and scalable in-memory key-value cache for small objects.

Juncheng Yang, Yao Yue, Rashmi Vinayak

Proceedings of the 18th USENIX Symposium on Networked Systems Design and Implementation, 2021

A locality-based lens for coded computation.

Michael Rudow, K. V. Rashmi, Venkatesan Guruswami

Proceedings of the IEEE International Symposium on Information Theory, 2021

Irregular Array Codes with Arbitrary Access Sets for Geo-Distributed Storage.

Francisco Maturana, K. V. Rashmi

Proceedings of the IEEE International Symposium on Information Theory, 2021

Boosting the Throughput and Accelerator Utilization of Specialized CNN Inference Beyond Increasing Batch Size.

Jack Kosaian, Amar Phanishayee, Matthai Philipose, Debadeepta Dey, Rashmi Vinayak

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Learning-Based Coded Computation.

Jack Kosaian, K. V. Rashmi, Shivaram Venkataraman

IEEE J. Sel. Areas Inf. Theory, 2020

A locality-based approach for coded computation.

Michael Rudow, K. V. Rashmi, Venkatesan Guruswami

CoRR, 2020

A large scale analysis of hundreds of in-memory cache clusters at Twitter.

Juncheng Yang, Yao Yue, K. V. Rashmi

Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation, 2020

PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy.

Saurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya, Juncheng Yang, K. V. Rashmi, Gregory R. Ganger

Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation, 2020

Access-optimal Linear MDS Convertible Codes for All Parameters.

Francisco Maturana, V. S. Chaitanya Mukka, K. V. Rashmi

Proceedings of the IEEE International Symposium on Information Theory, 2020

Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed Storage.

Francisco Maturana, K. V. Rashmi

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019

Convertible Codes: Efficient Conversion of Coded Data in Distributed Storage.

Francisco Maturana, K. V. Rashmi

CoRR, 2019

Parity Models: A General Framework for Coding-Based Resilience in ML Inference.

Jack Kosaian, K. V. Rashmi, Shivaram Venkataraman

CoRR, 2019

SysML: The New Frontier of Machine Learning Systems.

Alexander Ratner, Dan Alistarh, Gustavo Alonso, David G. Andersen, Peter Bailis, Sarah Bird, Nicholas Carlini, Bryan Catanzaro, Eric S. Chung, Bill Dally, Jeff Dean, Inderjit S. Dhillon, Alexandros G. Dimakis, Pradeep Dubey, Charles Elkan, Grigori Fursin, Gregory R. Ganger, Lise Getoor, Phillip B. Gibbons, Garth A. Gibson, Joseph E. Gonzalez, Justin Gottschlich, Song Han, Kim M. Hazelwood, Furong Huang, Martin Jaggi, Kevin G. Jamieson, Michael I. Jordan, Gauri Joshi, Rania Khalaf, Jason Knight, Jakub Konecný, Tim Kraska, Arun Kumar, Anastasios Kyrillidis, Jing Li, Samuel Madden, H. Brendan McMahan, Erik Meijer, Ioannis Mitliagkas, Rajat Monga, Derek Gordon Murray, Dimitris S. Papailiopoulos, Gennady Pekhimenko, Theodoros Rekatsinas, Afshin Rostamizadeh, Christopher Ré, Christopher De Sa, Hanie Sedghi, Siddhartha Sen, Virginia Smith, Alex Smola, Dawn Song, Evan R. Sparks, Ion Stoica, Vivienne Sze, Madeleine Udell, Joaquin Vanschoren, Shivaram Venkataraman, Rashmi Vinayak, Markus Weimer, Andrew Gordon Wilson, Eric P. Xing, Matei Zaharia, Ce Zhang, Ameet Talwalkar

CoRR, 2019

Parity models: erasure-coded resilience for prediction serving systems.

Jack Kosaian, K. V. Rashmi, Shivaram Venkataraman

Proceedings of the 27th ACM Symposium on Operating Systems Principles, 2019

Vantage: optimizing video upload for time-shifted viewing of social live streams.

Devdeep Ray, Jack Kosaian, K. V. Rashmi, Srinivasan Seshan

Proceedings of the ACM Special Interest Group on Data Communication, 2019

Cluster storage systems gotta have HeART: improving storage efficiency by exploiting disk-reliability heterogeneity.

Saurabh Kadekodi, K. V. Rashmi, Gregory R. Ganger

Proceedings of the 17th USENIX Conference on File and Storage Technologies, 2019

2018

Information-Theoretically Secure Erasure Codes for Distributed Storage.

K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar

IEEE Trans. Inf. Theory, 2018

Learning a Code: Machine Learning for Approximate Non-Linear Coded Computation.

Jack Kosaian, K. V. Rashmi, Shivaram Venkataraman

CoRR, 2018

Streaming Codes For Variable-Size Arrivals.

Michael Rudow, K. V. Rashmi

Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017

A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes.

K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran

IEEE Trans. Inf. Theory, 2017

2016

EC-Cache: Load-Balanced, Low-Latency Cluster Caching with Online Erasure Coding.

K. V. Rashmi, Mosharaf Chowdhury, Jack Kosaian, Ion Stoica, Kannan Ramchandran

Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation, 2016

Optimal systematic distributed storage codes with fast encoding.

Preetum Nakkiran, K. V. Rashmi, Kannan Ramchandran

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Distributed Secret Dissemination Across a Network.

Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran

IEEE J. Sel. Top. Signal Process., 2015

Having Your Cake and Eating It Too: Jointly Optimal Erasure Codes for I/O, Storage, and Network-bandwidth.

K. V. Rashmi, Preetum Nakkiran, Jingyan Wang, Nihar B. Shah, Kannan Ramchandran

Proceedings of the 13th USENIX Conference on File and Storage Technologies, 2015

DART: Dropouts meet Multiple Additive Regression Trees.

Korlakai Vinayak Rashmi, Ran Gilad-Bachrach

Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, 2015

2014

A "hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers.

K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, Kannan Ramchandran

Proceedings of the ACM SIGCOMM 2014 Conference, 2014

One extra bit of download ensures perfectly private information retrieval.

Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Optimality of the product-matrix construction for secure MSR regenerating codes.

Birenjith Sasidharan, P. Vijay Kumar, Nihar B. Shah, K. V. Rashmi, K. Ramachandran

Proceedings of the 6th International Symposium on Communications, 2014

Fundamental limits on communication for oblivious updates in storage networks.

Preetum Nakkiran, Nihar B. Shah, K. V. Rashmi

Proceedings of the IEEE Global Communications Conference, 2014

2013

Secure network coding for distributed secret sharing with low communication cost.

Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster.

K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, Kannan Ramchandran

Proceedings of the 5th USENIX Workshop on Hot Topics in Storage and File Systems, 2013

2012

Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions.

Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran

IEEE Trans. Inf. Theory, 2012

Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff.

Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran

IEEE Trans. Inf. Theory, 2012

Secret Share Dissemination across a Network

Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran

CoRR, 2012

Regenerating codes for errors and erasures in distributed storage.

K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction.

Korlakai Vinayak Rashmi, Nihar B. Shah, P. Vijay Kumar

IEEE Trans. Inf. Theory, 2011

Enabling node repair in any erasure code for distributed storage.

K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Information-Theoretically Secure Regenerating Codes for Distributed Storage.

Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar

Proceedings of the Global Communications Conference, 2011

2010

Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff

Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran

CoRR, 2010

The MISER Code: An MDS Distributed Storage Code that Minimizes Repair Bandwidth for Systematic Nodes through Interference Alignment

Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran

CoRR, 2010

Regenerating Codes for Distributed Storage Networks.

Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran

Proceedings of the Arithmetic of Finite Fields, Third International Workshop, 2010

Explicit and optimal codes for distributed storage.

K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran

Proceedings of the Information Theory and Applications Workshop, 2010

A flexible class of regenerating codes for distributed storage.

Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar

Proceedings of the IEEE International Symposium on Information Theory, 2010

Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storage.

K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Explicit Codes Minimizing Repair Bandwidth for Distributed Storage

Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran

CoRR, 2009

Exact Regenerating Codes for Distributed Storage

K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran

CoRR, 2009

Explicit construction of optimal exact regenerating codes for distributed storage.

K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran

Proceedings of the 47th Annual Allerton Conference on Communication, 2009