Bhuvan Urgaonkar

Bhuvan Urgaonkar

Auto-generated profile, based on publicly available information

Bhuvan Urgaonkar

The Pennsylvania State University

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 April 2024
Verified
Conference Paper
Open access
SSSultan Mahmud Sajal
Sultan Mahmud Sajal
TZTimothy Zhu
Timothy Zhu
BUBhuvan Urgaonkar
Bhuvan Urgaonkar
SSSiddhartha Sen
Siddhartha Sen

20 November 2024
Verified
Conference Paper
Open access
RHRubaba Hasan
Rubaba Hasan
TZTimothy Zhu
Timothy Zhu
BUBhuvan Urgaonkar
Bhuvan Urgaonkar
Burstable instances provide a low-cost option for consumers using the public cloud, but they come with significant resource limitations. They can be viewed as "fractional instances" where one receives a fraction of the compute and memory capacity at a fraction of the cost of regular instances. The fractional compute is achieved via rate limiting, where a unique characteristic of the rate limiting is that it allows for the CPU to burst to 100% utilization for limited periods of time. Prior research has shown how this ability to burst can be used to serve specific roles such as a cache backup and handling flash crowds. Our work provides a general-purpose approach to meeting latency SLOs via this burst capability while optimizing for cost. AutoBurst is able to achieve this by controlling both the number of burstable and regular instances along with how/when they are used. Evaluations show that our system is able to reduce cost by up to 25% over the state-of-the-art while maintaining latency SLOs.

6 November 2025 in ACM Transactions on Computer Systems
Verified
Journal Article
Open access
SSSultan Mahmud Sajal
Sultan Mahmud Sajal
SESalman Estyak
Salman Estyak
RHRubaba Hasan
Rubaba Hasan
TZTimothy Zhu
Timothy Zhu
BUBhuvan Urgaonkar
Bhuvan Urgaonkar
SSSiddhartha Sen
Siddhartha Sen
Trace replay is a common approach for evaluating systems by rerunning historical traffic patterns, but it’s not always possible to find suitable real-world traces at the desired level of system load. To experiment with different loads, one needs to downscale a trace to decrease the load or upscale a trace to artificially increase the load. This article expands upon our work, TraceUpscaler [ 92 ], by considering the interaction of upscaling and downscaling. In addition to evaluating upscaling with traces collected from a subset of the cluster, we also evaluate upscaling with traces that were downscaled with the state-of-the-art downscaling tool, TraceSplitter [ 91 ], to demonstrate that the upscaling and downscaling techniques are compatible and do not introduce unexpected artifacts in the scaling. In addition to comparing against prior approaches, we develop a novel upscaling technique, TraceOverlap , based on the idea of overlapping different time periods in a trace, where we identify the most similar time periods to overlap. Our evaluation demonstrates that TraceUpscaler and TraceOverlap are both more accurate in maintaining latency characteristics than prior approaches, with TraceUpscaler matching the original trace latency more closely. Finally, we provide a unified framework, TraceScaler , that combines TraceUpscaler with TraceSplitter to provide experimenters a common tool for their trace scaling needs.

27 February 2023 in Proceedings of the ACM on Measurement and Analysis of Computing Systems
Verified
Journal Article
Open access
KAKonstantin Avrachenkov
Konstantin Avrachenkov
PGPhillipa Gill
Phillipa Gill
BUBhuvan Urgaonkar
Bhuvan Urgaonkar
The Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS) focuses on the measurement and performance evaluation of computer systems and operates in close collaboration with the ACM Special Interest Group SIGMETRICS. All papers in this issue of POMACS will be presented at the ACM SIGMETRICS 2023 conference on June 19-23, 2023, in Orlando, Florida, USA. These papers have been selected during the fall submission round by the 91 members of the ACM SIGMETRICS 2023 program committee via a rigorous review process. Each paper was conditionally accepted (and shepherded), allowed a "one-shot" revision (to be resubmitted to one of the subsequent three SIGMETRICS deadlines), or rejected (with re-submission allowed after a year). For this issue, which represents the fall deadline, POMACS is publishing 26 papers out of 119 submissions. All submissions received at least 3 reviews and borderline cases were extensively discussed during the online program committee meeting. Based on the indicated track(s), roughly 21% of the submissions were in the Theory track, 40% were in the Measurement & Applied Modeling track, 29% were in the Systems track, and 39% were in the Learning track. Many individuals contributed to the success of this issue of POMACS. First, we would like to thank the authors, who submitted their best work to SIGMETRICS/POMACS. Second, we would like to thank the program committee members who provided constructive feedback in their reviews to authors and participated in the online discussions and program committee meeting. We also thank the several external reviewers who provided their expert opinion on specific submissions that required additional input. We are also grateful to the SIGMETRICS Board Chair, Giuliano Casale, and to past program committee Chairs, Niklas Carlsson, Edith Cohen, and Philippe Robert, who provided a wealth of information and guidance. Finally, we are grateful to the Organization Committee and to the SIGMETRICS Board for their ongoing efforts and initiatives for creating an exciting program for ACM SIGMETRICS 2023.

8 December 2022 in Proceedings of the ACM on Measurement and Analysis of Computing Systems
Verified
Journal Article
Open access
KAKonstantin Avrachenkov
Konstantin Avrachenkov
PGPhillipa Gill
Phillipa Gill
BUBhuvan Urgaonkar
Bhuvan Urgaonkar
The Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS) focuses on the measurement and performance evaluation of computer systems and operates in close collaboration with the ACM Special Interest Group SIGMETRICS. All papers in this issue of POMACS will be presented at the ACM SIGMETRICS 2023 conference on June 19-13, 2023, in Orlando, Florida, USA. These papers have been selected by the 82 members of the ACM SIGMETRICS 2023 program committee via a rigorous review process. Each paper was conditionally accepted (and shepherded), allowed a "one-shot" revision (to be resubmitted to one of the subsequent three SIGMETRICS deadlines), or rejected (with re-submission allowed after a year). For this issue, which represents the summer deadline, POMACS is publishing 17 papers out of 93 submissions. All submissions received at least 3 reviews and borderline cases were extensively discussed during the online program committee meeting. Based on the indicated track(s), roughly 30% of the submissions were in the Theory track, 39% were in the Measurement Applied Modeling track, 33% were in the Systems track, and 29% were in the Learning track. Many individuals contributed to the success of this issue of POMACS. First, we would like to thank the authors, who submitted their best work to SIGMETRICS/POMACS. Second, we would like to thank the program committee members who provided constructive feedback in their reviews to authors and participated in the online discussions and program committee meeting. We also thank the several external reviewers who provided their expert opinion on specific submissions that required additional input. We are also grateful to the SIGMETRICS Board Chair, Giuliano Casale, and to past program committee Chairs, Niklas Carlsson, Edith Cohen, and Philippe Robert, who provided a wealth of information and guidance. Finally, we are grateful to the Organization Committee and to the SIGMETRICS Board for their ongoing efforts and initiatives for creating an exciting program for ACM SIGMETRICS 2023.

4 September 2013 in arXiv
Verified
Preprint
Open access
PDF file
CWCheng Wang
Cheng Wang
BUBhuvan Urgaonkar
Bhuvan Urgaonkar
QWQian Wang
Qian Wang
GKGeorge Kesidis
George Kesidis
ASAnand Sivasubramaniam
Anand Sivasubramaniam
We formulate optimization problems to study how data centers might modulate their power demands for cost-effective operation taking into account three key complex features exhibited by real-world electricity pricing schemes: (i) time-varying prices (e.g., time-of-day pricing, spot pricing, or higher energy prices during coincident peaks) and (ii) separate charge for peak power consumption. Our focus is on demand modulation at the granularity of an entire data center or a large part of it. For computational tractability reasons, we work with a fluid model for power demands which we imagine can be modulated using two abstract knobs of demand dropping and demand delaying (each with its associated penalties or costs). Given many data center workloads and electric prices can be effectively predicted using statistical modeling techniques, we devise a stochastic dynamic program (SDP) that can leverage such predictive models. Since the SDP can be computationally infeasible in many real platforms, we devise approximations for it. We also devise fully online algorithms that might be useful for scenarios with poor power demand or utility price predictability. For one of our online algorithms, we prove a competitive ratio of 2-1/n. Finally, using empirical evaluation with both real-world and synthetic power demands and real-world prices, we demonstrate the efficacy of our techniques. As two salient empirically-gained insights: (i) demand delaying is more effective than demand dropping regarding to peak shaving (e.g., 10.74% cost saving with only delaying vs. 1.45% with only dropping for Google workload) and (ii) workloads tend to have different cost saving potential under various electricity tariffs (e.g., 16.97% cost saving under peak-based tariff vs. 1.55% under time-varying pricing tariff for Facebook workload).