default search action
K. V. Rashmi
Korlakai Vinayak Rashmi – Rashmi Vinayak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c51]Jiyu Hu
, Jack Kosaian
Rethinking Erasure-Coding Libraries in the Age of Optimized Machine Learning. HotStorage 2024 - [c50]Saransh Chopra, Francisco Maturana, K. V. Rashmi:
On Low Field Size Constructions of Access-Optimal Convertible Codes. ISIT 2024: 1456-1461 - [c49]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 - [c48]Timothy Kim
Morph: Efficient File-Lifetime Redundancy Management for Cluster File Systems. SOSP 2024: 330-346 - [c47]Andrew Park, Trevor Leong, Francisco Maturana, Wenting Zheng, K. V. Rashmi:
Communication-efficient, Fault Tolerant PIR over Erasure Coded Storage. SP 2024: 4331-4347 - [i30]Saransh Chopra, Francisco Maturana, K. V. Rashmi:
On Low Field Size Constructions of Access-Optimal Convertible Codes. CoRR abs/2405.09010 (2024) - [i29]Yixuan Mei, Yonghao Zhuang, Xupeng Miao, Juncheng Yang, Zhihao Jia, Rashmi Vinayak:
Helix: Distributed Serving of Large Language Models via Max-Flow on Heterogeneous GPUs. CoRR abs/2406.01566 (2024) - 2023
- [j13]Tianyu Zhang, Kaige Liu, Jack Kosaian, Juncheng Yang, Rashmi Vinayak:
Efficient Fault Tolerance for Recommendation Model Training via Erasure Coding. Proc. VLDB Endow. 16(11): 3137-3150 (2023) - [j12]Michael Rudow
Online Versus Offline Rate in Streaming Codes for Variable-Size Messages. IEEE Trans. Inf. Theory 69(6): 3674-3690 (2023) - [j11]Francisco Maturana
Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions. IEEE Trans. Inf. Theory 69(8): 4993-5008 (2023) - [c46]Juncheng Yang, Ziming Mao, Yao Yue, K. V. Rashmi:
GL-Cache: Group-level learning for efficient and high-performance caching. FAST 2023: 115-134 - [c45]Juncheng Yang
FIFO can be Better than LRU: the Power of Lazy Promotion and Quick Demotion. HotOS 2023: 70-79 - [c44]Michael Rudow, K. V. Rashmi:
Learning-augmented streaming codes for variable-size messages under partial burst losses. ISIT 2023: 1101-1106 - [c43]Francisco Maturana, K. V. Rashmi:
Locally Repairable Convertible Codes: Erasure Codes for Efficient Repair and Conversion. ISIT 2023: 2033-2038 - [c42]Michael Rudow, Venkatesan Guruswami, K. V. Rashmi:
On expanding the toolkit of locality-based coded computation to the coordinates of inputs. ISIT 2023: 2171-2176 - [c41]Michael Rudow, Neophytos Charalambides, Alfred O. Hero III, K. V. Rashmi:
Compression-Informed Coded Computing. ISIT 2023: 2177-2182 - [c40]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: 953-971 - [c39]Juncheng Yang
FIFO queues are all you need for cache eviction. SOSP 2023: 130-149 - 2022
- [j10]Francisco Maturana
Convertible Codes: Enabling Efficient Conversion of Coded Data in Distributed Storage. IEEE Trans. Inf. Theory 68(7): 4392-4407 (2022) - [j9]Michael Rudow
Streaming Codes for Variable-Size Messages. IEEE Trans. Inf. Theory 68(9): 5823-5849 (2022) - [c38]Michael Rudow, K. V. Rashmi:
Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size Messages. ISIT 2022: 474-479 - [c37]Francisco Maturana, K. V. Rashmi:
Bandwidth Cost of Code Conversions in the Split Regime. ISIT 2022: 3262-3267 - [c36]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: 1159-1177 - [c35]Saurabh Kadekodi, Francisco Maturana, Sanjith Athlur, Arif Merchant, K. V. Rashmi, Gregory R. Ganger:
Tiger: Disk-Adaptive Redundancy Without Placement Restrictions. OSDI 2022: 413-429 - [i28]Francisco Maturana, K. V. Rashmi:
Bandwidth Cost of Code Conversions in the Split Regime. CoRR abs/2205.06793 (2022) - [i27]Michael Rudow, K. V. Rashmi:
Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size Messages. CoRR abs/2205.08521 (2022) - 2021
- [j8]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): 17:1-17:35 (2021) - [c34]Jack Kosaian, Amar Phanishayee, Matthai Philipose, Debadeepta Dey, Rashmi Vinayak:
Boosting the Throughput and Accelerator Utilization of Specialized CNN Inference Beyond Increasing Batch Size. ICML 2021: 5731-5741 - [c33]Michael Rudow, K. V. Rashmi, Venkatesan Guruswami:
A locality-based lens for coded computation. ISIT 2021: 1070-1075 - [c32]Francisco Maturana, K. V. Rashmi:
Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions. ISIT 2021: 2334-2339 - [c31]Francisco Maturana, K. V. Rashmi:
Irregular Array Codes with Arbitrary Access Sets for Geo-Distributed Storage. ISIT 2021: 3002-3007 - [c30]Juncheng Yang, Yao Yue, Rashmi Vinayak:
Segcache: a memory-efficient and scalable in-memory key-value cache for small objects. NSDI 2021: 503-518 - [c29]Jack Kosaian, K. V. Rashmi:
Arithmetic-intensity-guided fault tolerance for neural network inference on GPUs. SC 2021: 79 - [i26]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 abs/2103.08191 (2021) - [i25]Kaige Liu, Jack Kosaian, K. V. Rashmi:
ECRM: Efficient Fault Tolerance for Recommendation Model Training via Erasure Coding. CoRR abs/2104.01981 (2021) - [i24]Jack Kosaian, K. V. Rashmi:
Arithmetic-Intensity-Guided Fault Tolerance for Neural Network Inference on GPUs. CoRR abs/2104.09455 (2021) - 2020
- [j7]Jack Kosaian
Learning-Based Coded Computation. IEEE J. Sel. Areas Inf. Theory 1(1): 227-236 (2020) - [c28]Francisco Maturana
Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed Storage. ITCS 2020: 66:1-66:26 - [c27]Michael Rudow, K. V. Rashmi:
Online Versus Offline Rate in Streaming Codes for Variable-Size Messages. ISIT 2020: 509-514 - [c26]Francisco Maturana, V. S. Chaitanya Mukka, K. V. Rashmi:
Access-optimal Linear MDS Convertible Codes for All Parameters. ISIT 2020: 577-582 - [c25]Juncheng Yang, Yao Yue, K. V. Rashmi:
A large scale analysis of hundreds of in-memory cache clusters at Twitter. OSDI 2020: 191-208 - [c24]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: 369-385 - [i23]Michael Rudow, K. V. Rashmi, Venkatesan Guruswami:
A locality-based approach for coded computation. CoRR abs/2002.02440 (2020) - [i22]Francisco Maturana, V. S. Chaitanya Mukka, K. V. Rashmi:
Access-optimal Linear MDS Convertible Codes for All Parameters. CoRR abs/2006.03042 (2020) - [i21]Michael Rudow, K. V. Rashmi:
Online Versus Offline Rate in Streaming Codes for Variable-Size Messages. CoRR abs/2006.03045 (2020) - [i20]Francisco Maturana, K. V. Rashmi:
Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions. CoRR abs/2008.12707 (2020)
2010 – 2019
- 2019
- [c23]Saurabh Kadekodi, K. V. Rashmi, Gregory R. Ganger:
Cluster storage systems gotta have HeART: improving storage efficiency by exploiting disk-reliability heterogeneity. FAST 2019: 345-358 - [c22]Devdeep Ray, Jack Kosaian, K. V. Rashmi, Srinivasan Seshan
Vantage: optimizing video upload for time-shifted viewing of social live streams. SIGCOMM 2019: 380-393 - [c21]Jack Kosaian, K. V. Rashmi, Shivaram Venkataraman:
Parity models: erasure-coded resilience for prediction serving systems. SOSP 2019: 30-46 - [i19]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
SysML: The New Frontier of Machine Learning Systems. CoRR abs/1904.03257 (2019) - [i18]Jack Kosaian, K. V. Rashmi, Shivaram Venkataraman:
Parity Models: A General Framework for Coding-Based Resilience in ML Inference. CoRR abs/1905.00863 (2019) - [i17]Francisco Maturana, K. V. Rashmi:
Convertible Codes: Efficient Conversion of Coded Data in Distributed Storage. CoRR abs/1907.13119 (2019) - 2018
- [j6]K. V. Rashmi
Information-Theoretically Secure Erasure Codes for Distributed Storage. IEEE Trans. Inf. Theory 64(3): 1621-1646 (2018) - [c20]Michael Rudow, K. V. Rashmi:
Streaming Codes For Variable-Size Arrivals. Allerton 2018: 733-740 - [i16]Jack Kosaian, K. V. Rashmi, Shivaram Venkataraman:
Learning a Code: Machine Learning for Approximate Non-Linear Coded Computation. CoRR abs/1806.01259 (2018) - 2017
- [j5]K. V. Rashmi
A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes. IEEE Trans. Inf. Theory 63(9): 5802-5820 (2017) - 2016
- [b1]Rashmi Vinayak:
Erasure Coding for Big-data Systems: Theory and Practice. University of California, Berkeley, USA, 2016 - [c19]Preetum Nakkiran, K. V. Rashmi, Kannan Ramchandran:
Optimal systematic distributed storage codes with fast encoding. ISIT 2016: 430-434 - [c18]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: 401-417 - 2015
- [j4]Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran:
Distributed Secret Dissemination Across a Network. IEEE J. Sel. Top. Signal Process. 9(7): 1206-1216 (2015) - [c17]Korlakai Vinayak Rashmi, Ran Gilad-Bachrach:
DART: Dropouts meet Multiple Additive Regression Trees. AISTATS 2015 - [c16]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: 81-94 - [i15]K. V. Rashmi, Ran Gilad-Bachrach:
DART: Dropouts meet Multiple Additive Regression Trees. CoRR abs/1505.01866 (2015) - [i14]Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran, P. Vijay Kumar:
Information-theoretically Secure Erasure Codes for Distributed Storage. CoRR abs/1508.03787 (2015) - [i13]Preetum Nakkiran, K. V. Rashmi, Kannan Ramchandran:
Optimal Systematic Distributed Storage Codes with Fast Encoding. CoRR abs/1509.01858 (2015) - 2014
- [c15]Preetum Nakkiran, Nihar B. Shah, K. V. Rashmi:
Fundamental limits on communication for oblivious updates in storage networks. GLOBECOM 2014: 2363-2368 - [c14]Birenjith Sasidharan
Optimality of the product-matrix construction for secure MSR regenerating codes. ISCCSP 2014: 10-14 - [c13]Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran:
One extra bit of download ensures perfectly private information retrieval. ISIT 2014: 856-860 - [c12]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: 331-342 - [i12]Preetum Nakkiran, Nihar B. Shah, K. V. Rashmi:
Fundamental Limits on Communication for Oblivious Updates in Storage Networks. CoRR abs/1409.1666 (2014) - 2013
- [c11]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 - [c10]K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran:
A piggybacking design framework for read-and download-efficient distributed storage codes. ISIT 2013: 331-335 - [c9]Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran:
Secure network coding for distributed secret sharing with low communication cost. ISIT 2013: 2404-2408 - [i11]K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran:
A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes. CoRR abs/1302.5872 (2013) - [i10]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 abs/1309.0186 (2013) - 2012
- [j3]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): 1837-1852 (2012) - [j2]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): 2134-2158 (2012) - [c8]K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar:
Regenerating codes for errors and erasures in distributed storage. ISIT 2012: 1202-1206 - [i9]K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar:
Regenerating Codes for Errors and Erasures in Distributed Storage. CoRR abs/1202.1050 (2012) - [i8]Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran:
Secret Share Dissemination across a Network. CoRR abs/1207.0120 (2012) - 2011
- [j1]Korlakai Vinayak 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. IEEE Trans. Inf. Theory 57(8): 5227-5239 (2011) - [c7]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar:
Information-Theoretically Secure Regenerating Codes for Distributed Storage. GLOBECOM 2011: 1-5 - [c6]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar:
Enabling node repair in any erasure code for distributed storage. ISIT 2011: 1235-1239 - [i7]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar:
Enabling Node Repair in Any Erasure Code for Distributed Storage. CoRR abs/1101.0133 (2011) - [i6]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar:
Information-theoretically Secure Regenerating Codes for Distributed Storage. CoRR abs/1107.5279 (2011) - 2010
- [c5]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: 1938-1942 - [c4]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar:
A flexible class of regenerating codes for distributed storage. ISIT 2010: 1943-1947 - [c3]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran:
Explicit and optimal codes for distributed storage. ITA 2010: 240-244 - [c2]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran:
Regenerating Codes for Distributed Storage Networks. WAIFI 2010: 215-223 - [i5]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 abs/1005.1634 (2010) - [i4]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 abs/1005.4178 (2010) - [i3]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 abs/1011.2361 (2010)
2000 – 2009
- 2009
- [c1]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar
Explicit construction of optimal exact regenerating codes for distributed storage. Allerton 2009: 1243-1249 - [i2]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran:
Exact Regenerating Codes for Distributed Storage. CoRR abs/0906.4913 (2009) - [i1]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran:
Explicit Codes Minimizing Repair Bandwidth for Distributed Storage. CoRR abs/0908.2984 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: