A Novel Hierarchical Co-Optimization Framework for Coordinated Task Scheduling and Power Dispatch in Computing Power Networks
Haoxiang Luo, Kun Yang, Qi Huang, Marco Aiello, Schahram Dustdar

TL;DR
This paper introduces a two-stage co-optimization framework for computing power networks that enhances efficiency, reduces carbon emissions, and improves task scheduling by integrating deep reinforcement learning with power dispatch strategies.
Contribution
It presents a novel hierarchical co-optimization framework combining stochastic unit commitment and real-time adaptive task scheduling using deep reinforcement learning.
Findings
Reduces carbon emissions by 16.2%
Decreases operational costs by 12.7%
Cuts RES curtailment by over 60%
Abstract
The proliferation of large-scale AI and data-intensive applications has driven the development of Computing Power Networks (CPN). It is a key paradigm for delivering ubiquitous, on-demand computational services with high efficiency. However, CPNs face dual challenges in service computing. Immense energy consumption threatens sustainable operations. And the integration with power grids also features high penetration of intermittent Renewable Energy Sources (RES), complicating task scheduling while ensuring Quality of Service (QoS). To address these issues, this paper proposes a novel Two-Stage Co-Optimization (TSCO) framework. It synergistically coordinates CPN task scheduling and power system dispatch, aiming to optimize service performance while achieving low-carbon operations. The framework decomposes the complex, large-scale problem into a day-ahead stochastic unit commitment stage…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
