arXiv subjects

Ana Radovanović

Publications and source records attributed to Ana Radovanović.

4 recordsLinked to original sources

arXiv2026

A Cherry-Picking Approach to Large Load Shaping for More Effective Carbon Reduction

Shaping multi-megawatt loads, such as data centers, impacts generator dispatch on the electric grid, which in turn affects system CO2 emissions and energy cost. Substantiating the effectiveness of prevalent load shaping strategies, such as those based on grid-level average carbon intensity, locational marginal price, or marginal emissions, is challenging due to the lack of detailed counterfactual data required for accurate attribution. This study uses a series of calibrated granular ERCOT day-ahead direct current optimal power flow (DC-OPF) simulations for counterfactual analysis of a broad set of load shaping strategies on grid CO2 emissions and cost of electricity. In terms of annual grid level CO2 emissions reductions, LMP-based shaping outperforms other common strategies, but can be significantly improved upon. Examining the performance of practicable strategies under different grid conditions motivates a more effective load shaping approach: one that "cherry-picks" a daily strategy based on observable grid signals and historical data. The cherry-picking approach to power load shaping is applicable to any large flexible consumer on the electricity grid, such as data centers, distributed energy resources and Virtual Power Plants (VPPs).

stat.ML↗

arXiv2025

Carbon-Aware Computing for Data Centers with Probabilistic Performance Guarantees

Data centers are significant contributors to carbon emissions and can strain power systems due to their high electricity consumption. To mitigate this impact and to participate in demand response programs, cloud computing companies strive to balance and optimize operations across their global fleets by making strategic decisions about when and where to place compute jobs for execution. In this paper, we introduce a load shaping scheme which reacts to time-varying grid signals by leveraging both temporal and spatial flexibility of compute jobs to provide risk-aware management guidelines and job placement with provable performance guarantees based on distributionally robust optimization. Our approach divides the problem into two key components: (i) day-ahead planning, which generates an optimal scheduling strategy based on historical load data, and (ii) real-time job placement and (time) scheduling, which dynamically tracks the optimal strategy generated in (i). We validate our method in simulation using normalized load profiles from randomly selected Google clusters, incorporating time-varying grid signals. We can demonstrate significant reductions in carbon cost and peak power with our approach compared to myopic greedy policies, while maintaining computational efficiency and abiding to system and grid constraints.

eess.SY↗

arXiv2021

Modelling of Supercapacitor Banks for Power System Dynamics Studies

The paper presents accurate and simple dynamic model of a supercapacitor bank system for power system dynamics studies. The proposed model is derived from a detailed RC circuit representation. Furthermore, a complete control system of the supercapacitor bank is also presented. The proposed model is easy to integrate in any power system simulation software and consists of only up to four standard datasheet parameters. The performance of the proposed model in grid frequency control and low-voltage ride through is illustrated on IEEE 14-bus test system in DIgSILENT PowerFactory. It is shown that in case of transient stability simulations the ideal (simplified) model of the supercapacitor can be used while in case of frequency control the ideal representation may not always be appropriate.

eess.SY↗

arXiv2007

Asymptotic Blocking Probabilities in Loss Networks with Subexponential Demands

The analysis of stochastic loss networks has long been of interest in computer and communications networks and is becoming important in the areas of service and information systems. In traditional settings, computing the well known Erlang formula for blocking probability in these systems becomes intractable for larger resource capacities. Using compound point processes to capture stochastic variability in the request process, we generalize existing models in this framework and derive simple asymptotic expressions for blocking probabilities. In addition, we extend our model to incorporate reserving resources in advance. Although asymptotic, our experiments show an excellent match between derived formulas and simulation results even for relatively small resource capacities and relatively large values of blocking probabilities.

math.PR↗