Searcharxiv⌕ Search

arXiv subjects

Julia Lindberg

Publications and source records attributed to Julia Lindberg.

22 records · Page 2Linked to original sources

A Guide to Reducing Carbon Emissions through Data Center Geographical Load Shifting

Recent computing needs have lead technology companies to develop large scale, highly optimized data centers. These data centers represent large loads on electric power networks which have the unique flexibility to shift load both geographically and temporally. This paper focuses on how data centers can use their geographic load flexibility to reduce carbon emissions through clever interactions with electricity markets. Because electricity market clearing accounts for congestion and power flow physics in the electric grid, the carbon emissions associated with electricity use varies between (potentially geographically close) locations. Using our knowledge about this process, we propose a new and improved metric to guide geographic load shifting, which we refer to as the locational marginal carbon emission $λ_{\text{CO}_2}$. We compare this and three other shifting metrics on their ability to reduce carbon emissions and generation costs throughout the course of a year. Our analysis demonstrates that $λ_{\text{CO}_2}$ is more effective in reducing carbon emissions than more commonly proposed metrics that do not account for the specifics of the power grid.

eess.SY↗

Exploiting Symmetry in the Power Flow Equations Using Monodromy

We propose solving the power flow equations using monodromy. We prove the variety under consideration decomposes into trivial and nontrivial subvarieties and that the nontrivial subvariety is irreducible. We also show various symmetries in the solutions. We finish by giving numerical results comparing monodromy against polyhedral and total degree homotopy methods and giving an example of a network where we can find all solutions to the power flow equation using monodromy where other homotopy techniques fail. This work gives hope that finding all solutions to the power flow equations for networks of realistic size is possible.

math.AG↗

The Environmental Potential of Hyper-Scale Data Centers: Using Locational Marginal CO$_2$ Emissions to Guide Geographical Load Shifting

Increasing demand for computing has lead to the development of large-scale, highly optimized data centers, which represent large loads in the electric power network. Many major computing and internet companies operate multiple data centers spread geographically across the world. Thus, these companies have a unique ability to shift computing load, and thus electric load, geographically. This paper provides a "bottom-up" load shifting model which uses data centers' geographic load flexibility to lower CO$_2$ emissions. This model utilizes information about the locational marginal CO$_2$ footprint of the electricity at individual nodes, but does not require direct collaboration with the system operator. We demonstrate how to calculate marginal carbon emissions, and assess the efficacy of our approach compared to a setting where the data centers bid their flexibility into a centralized market. We find that data center load shifting can achieve substantial reductions in CO$_2$ emissions even with modest load shifting.

eess.SY↗

The Distribution of the Number of Real Solutions to the Power Flow Equations

In this paper we study the distributions of the number of real solutions to the power flow equations over varying electrical parameters. We introduce a new monodromy and parameter homotopy continuation method for quickly finding all solutions to the power flow equations. We apply this method to find distributions of the number of real solutions to the power flow equations and compare these distributions to those of random polynomials. It is observed that while the power flow equations tend to admit many fewer real-valued solutions than a bound on the total number of complex solutions, for low levels of load they tend to admit many more than a corresponding random polynomial. We show that for cycle graphs the number of real solutions can achieve the maximum bound for specific parameter values and for complete graphs with four or more vertices there are susceptance values that give infinitely many real solutions.

math.AG↗