K. V. Rashmi - RankMe

92 papers A* 10A 7B 23C 1Misc 4Journal 41Unranked 6

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