User profiles for Nihar B. Shah
Nihar B. ShahML and CS departments, Carnegie Mellon University Verified email at cs.cmu.edu Cited by 7483 |
Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction
Regenerating codes are a class of distributed storage codes that allow for efficient repair of
failed nodes, as compared to traditional erasure codes. An $[n, k, d]$ regenerating code …
failed nodes, as compared to traditional erasure codes. An $[n, k, d]$ regenerating code …
Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff
… This work was done while Nihar B. Shah and KV Rashmi were at the Dept. of ECE, Indian
Institute of Science, Bangalore, India. Preliminary versions of this paper were presented at …
Institute of Science, Bangalore, India. Preliminary versions of this paper were presented at …
When do redundant requests reduce latency?
Many systems possess the flexibility to serve requests in more than one way, such as
distributed storage systems that store multiple copies of the data. In such systems, the latency of …
distributed storage systems that store multiple copies of the data. In such systems, the latency of …
A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the Facebook warehouse cluster
Erasure codes, such as Reed-Solomon (RS) codes, are being increasingly employed in data
centers to combat the cost of reliably storing large amounts of data. Although these codes …
centers to combat the cost of reliably storing large amounts of data. Although these codes …
Interference alignment in regenerating codes for distributed storage: Necessity and code constructions
… This work was done while Nihar B. Shah and KV Rashmi were at the Dept. of ECE, Indian
Institute of Science, Bangalore, India. The material in this paper was presented in part at the …
Institute of Science, Bangalore, India. The material in this paper was presented in part at the …
Explicit construction of optimal exact regenerating codes for distributed storage
Erasure coding techniques are used to increase the reliability of distributed storage systems
while minimizing storage overhead. Also of interest is minimization of the bandwidth …
while minimizing storage overhead. Also of interest is minimization of the bandwidth …
A" hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers
Erasure codes such as Reed-Solomon (RS) codes are being extensively deployed in data
centers since they offer significantly higher reliability than data replication methods at much …
centers since they offer significantly higher reliability than data replication methods at much …
Reviewergpt? an exploratory study on using large language models for paper reviewing
Given the rapid ascent of large language models (LLMs), we study the question: (How) can
large language models help in reviewing of scientific papers or proposals? We first conduct …
large language models help in reviewing of scientific papers or proposals? We first conduct …
Simple, robust and optimal ranking from pairwise comparisons
NB Shah, MJ Wainwright - Journal of machine learning research, 2018 - jmlr.org
We consider data in the form of pairwise comparisons of n items, with the goal of identifying
the top k items for some value of k < n, or alternatively, recovering a ranking of all the items. …
the top k items for some value of k < n, or alternatively, recovering a ranking of all the items. …
One extra bit of download ensures perfectly private information retrieval
Private information retrieval (PIR) systems allow a user to retrieve a record from a public
database without revealing to the server which record is being retrieved. The literature on PIR …
database without revealing to the server which record is being retrieved. The literature on PIR …