关注
Vipul Harsh
Vipul Harsh
在 illinois.edu 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Histogram sort with sampling
V Harsh, L Kale, E Solomonik
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 201-212, 2019
16*2019
Spineless data centers
V Harsh, SA Jyothi, PB Godfrey
Proceedings of the 19th ACM Workshop on Hot Topics in Networks, 67-73, 2020
152020
Expander datacenters: From theory to practice
V Harsh, SA Jyothi, I Singh, P Godfrey
arXiv preprint arXiv:1811.00212, 2018
72018
Murphy: Performance Diagnosis of Distributed Cloud Applications
V Harsh, W Zhou, S Ashok, RN Mysore, B Godfrey, S Banerjee
Proceedings of the ACM SIGCOMM 2023 Conference, 438-451, 2023
62023
Flock: Accurate network fault localization at scale
V Harsh, T Meng, K Agrawal, PB Godfrey
Proceedings of the ACM on Networking 1 (CoNEXT1), 1-22, 2023
22023
TraceWeaver: Distributed Request Tracing for Microservices Without Application Modification
S Ashok, V Harsh, B Godfrey, R Mittal, S Parthasarathy, L Shwartz
Conference of the ACM Special Interest Group on Data Communication, 2024
2024
Providing Explanation of Network Incident Root Causes
V Harsh, W Zhou, R Niranjan Mysore, PB Godfrey, S Banerjee
US Patent App. 18/094,380, 2024
2024
On-demand Network Incident Graph Generation
V Harsh, W Zhou, R Niranjan Mysore, PB Godfrey, S Banerjee
US Patent App. 18/094,378, 2024
2024
Network Incident Root-Cause Analysis
V Harsh, W Zhou, R Niranjan Mysore, PB Godfrey, S Banerjee
US Patent App. 18/094,379, 2024
2024
Systems, Models and Algorithms for Failure Diagnosis in Networked Infrastructure
V Harsh
2024
Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting
W Yang, V Harsh, E Solomonik
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023
2023
系统目前无法执行此操作,请稍后再试。
文章 1–11