Predictive Electricity Cost Minimization Through Energy Buffering in Data Centers
Bibliographic record
Abstract
More and more cloud computing services are handled by different Internet operators in distributed Internet data centers (IDCs), which incurs massive electricity costs. Today, the power usage of data centers contributes to more than 1.5% market share of electricity consumption across the United States. Minimization of these costs benefits cloud computing operators, and attracts increasing attentions from many research groups and industrial sectors. Along with the deployment of smart grid, the electrical real-time pricing policy promotes power consumers to adaptively schedule their electricity utilization for lower operational costs. This paper proposes a novel approach to enable electrical energy buffering in batteries to predictively minimize IDC electricity costs in smart grid. Batteries are charged when electricity price is low and discharged to power servers when electricity price is high. A power management controller is used per battery to arbitrate the charging and discharging actions of the battery. The controller is designed as a MPC-based (model predictive control) controller. To this end, an MPC power minimization problem is formulated based on a discrete state-space model with states of battery power level and cost. Extensive simulation results demonstrate the effectiveness of our approach based on real-life electricity prices in smart grid.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".