Follow
K. V. Rashmi (Rashmi Vinayak)
K. V. Rashmi (Rashmi Vinayak)
Other namesRashmi Vinayak
Associate Professor, CS, Carnegie Mellon University
Verified email at cs.cmu.edu - Homepage
Title
Cited by
Cited by
Year
Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction
KV Rashmi*, NB Shah*, PV Kumar (* = equal contribution)
Information Theory, IEEE Transactions on 57 (8), 5227-5239, 2011
8602011
A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the Facebook warehouse cluster
KV Rashmi, NB Shah, D Gu, H Kuang, D Borthakur, K Ramchandran
5th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage 13), 2013
3522013
Explicit construction of optimal exact regenerating codes for distributed storage
KV Rashmi, NB Shah, PV Kumar, K Ramchandran
2009 47th Annual Allerton Conference on Communication, Control, and …, 2009
3372009
Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff
NB Shah, KV Rashmi, PV Kumar, K Ramchandran
IEEE Transactions on Information Theory 58 (3), 1837-1852, 2011
3112011
A" hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers
KV Rashmi, NB Shah, D Gu, H Kuang, D Borthakur, K Ramchandran
Proceedings of the 2014 ACM conference on SIGCOMM, 331-342, 2014
2912014
Dart: Dropouts meet multiple additive regression trees
RK Vinayak, R Gilad-Bachrach
Artificial Intelligence and Statistics, 489-497, 2015
2852015
Interference alignment in regenerating codes for distributed storage: Necessity and code constructions
NB Shah*, KV Rashmi*, PV Kumar, ...
Information Theory, IEEE Transactions on 58 (4), 2134-2158, 2012
2522012
A large-scale analysis of hundreds of in-memory key-value cache clusters at twitter
J Yang, Y Yue, KV Rashmi
ACM Transactions on Storage (TOS) 17 (3), 1-35, 2021
2302021
One extra bit of download ensures perfectly private information retrieval
NB Shah, KV Rashmi, K Ramchandran
2014 IEEE International Symposium on Information Theory, 856-860, 2014
2252014
{EC-Cache}:{Load-Balanced},{Low-Latency} Cluster Caching with Online Erasure Coding
KV Rashmi, M Chowdhury, J Kosaian, I Stoica, K Ramchandran
12th USENIX Symposium on Operating Systems Design and Implementation (OSDI …, 2016
1862016
Having your cake and eating it too: Jointly optimal erasure codes for {I/O}, storage, and network-bandwidth
KV Rashmi, P Nakkiran, J Wang, NB Shah, K Ramchandran
13th USENIX Conference on File and Storage Technologies (FAST 15), 81-94, 2015
1692015
Information-theoretically secure regenerating codes for distributed storage
NB Shah*, KV Rashmi*, PV Kumar (* = equal contribution)
Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE, 1-5, 2011
1392011
A piggybacking design framework for read-and download-efficient distributed storage codes
KV Rashmi, NB Shah, K Ramchandran
IEEE Transactions on Information Theory 63 (9), 5802-5820, 2017
1232017
Explicit codes uniformly reducing repair bandwidth in distributed storage
NB Shah*, KV Rashmi*, PV Kumar, ...
Communications (NCC), 2010 National Conference on, 1-5, 2010
114*2010
Regenerating codes for errors and erasures in distributed storage
KV Rashmi*, NB Shah*, K Ramchandran, ...
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on …, 2012
1122012
A flexible class of regenerating codes for distributed storage
NB Shah*, KV Rashmi*, PV Kumar (* = equal contribution)
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on …, 2010
722010
Learning-based coded computation
J Kosaian, KV Rashmi, S Venkataraman
IEEE Journal on Selected Areas in Information Theory 1 (1), 227-236, 2020
71*2020
Parity models: erasure-coded resilience for prediction serving systems
J Kosaian, KV Rashmi, S Venkataraman
Proceedings of the 27th ACM Symposium on Operating Systems Principles, 30-46, 2019
63*2019
Cluster storage systems gotta have {HeART}: improving storage efficiency by exploiting disk-reliability heterogeneity
S Kadekodi, KV Rashmi, GR Ganger
17th USENIX Conference on File and Storage Technologies (FAST 19), 345-358, 2019
632019
Enabling node repair in any erasure code for distributed storage
KV Rashmi*, NB Shah*, PV Kumar (* = equal contribution)
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on …, 2011
632011
The system can't perform the operation now. Try again later.
Articles 1–20