4 papers
Agentic RCA for Internet-Scale Services Using Constrained Creativity
Sayan Sinha, Vipul Harsh, B. Aditya Prakash +2
System administrators of Internet-scale services need to resolve failure incidents to maintain reliability of such services. Ideally, we want a troubleshooting system to be: (1) ex…
Flock: Accurate network fault localization at scale
Vipul Harsh, Tong Meng, Kapil Agrawal +1
Inferring the root cause of failures among thousands of components in a data center network is challenging, especially for "gray" failures that are not reported directly by switche…
Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting
Wentao Yang, Vipul Harsh, Edgar Solomonik
State-of-the-art parallel sorting algorithms for distributed-memory architectures are based on computing a balanced partitioning via sampling and histogramming. By finding samples…
Histogram Sort with Sampling
Vipul Harsh, Laxmikant Kale, Edgar Solomonik
To minimize data movement, state-of-the-art parallel sorting algorithms use techniques based on sampling and histogramming to partition keys prior to redistribution. Sampling enabl…