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
7802011
Explicit construction of optimal exact regenerating codes for distributed storage
KV Rashmi*, NB Shah*, PV Kumar, ...
Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual …, 2009
3312009
Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff
NB Shah*, KV Rashmi*, PV Kumar, ...
Information Theory, IEEE Transactions on 58 (3), 1837-1852, 2012
2942012
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
2872013
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
2602014
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
2422012
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
1932014
Dart: Dropouts meet multiple additive regression trees
RK Vinayak, R Gilad-Bachrach
Artificial Intelligence and Statistics, 489-497, 2015
1642015
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
1482015
{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
1372016
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
1332011
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
1042012
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
982017
A large scale analysis of hundreds of in-memory cache clusters at Twitter
J Yang, Y Yue, KV Rashmi
14th USENIX Symposium on Operating Systems Design and Implementation (OSDI …, 2020
652020
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
632010
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
552011
Learning-based coded computation
J Kosaian, KV Rashmi, S Venkataraman
IEEE Journal on Selected Areas in Information Theory 1 (1), 227-236, 2020
49*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
37*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
352019
The system can't perform the operation now. Try again later.
Articles 1–20