Follow
K. V. Rashmi (Rashmi Vinayak)
K. V. Rashmi (Rashmi Vinayak)
Assistant 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
8012011
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
3322009
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
3032013
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
2992011
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
2682014
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
2462012
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
2072014
Dart: Dropouts meet multiple additive regression trees
RK Vinayak, R Gilad-Bachrach
Artificial Intelligence and Statistics, 489-497, 2015
2002015
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
FAST, 81-94, 2015
1512015
EC-Cache: Load-Balanced, Low-Latency Cluster Caching with Online Erasure Coding.
KV Rashmi, M Chowdhury, J Kosaian, I Stoica, K Ramchandran
Osdi 16, 401-417, 2016
1492016
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
1342011
Explicit codes uniformly reducing repair bandwidth in distributed storage
NB Shah*, KV Rashmi*, PV Kumar, ...
Communications (NCC), 2010 National Conference on, 1-5, 2010
111*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
1052012
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
1042017
A large scale analysis of hundreds of in-memory cache clusters at Twitter
J Yang, Y Yue, KV Rashmi
Proceedings of the 14th USENIX Conference on Operating Systems Design and …, 2020
972020
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
662010
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
582011
Learning-based coded computation
J Kosaian, KV Rashmi, S Venkataraman
IEEE Journal on Selected Areas in Information Theory 1 (1), 227-236, 2020
53*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
46*2019
Cluster storage systems gotta have HeART: improving storage efficiency by exploiting disk-reliability heterogeneity.
S Kadekodi, KV Rashmi, GR Ganger
FAST, 345-358, 2019
382019
The system can't perform the operation now. Try again later.
Articles 1–20