A Novel Hierarchical Co-Optimization Framework for Coordinated Task Scheduling and Power Dispatch in Computing Power Networks
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918320290136064 |
|---|---|
| author | Luo, Haoxiang Yang, Kun Huang, Qi Aiello, Marco Dustdar, Schahram |
| author_facet | Luo, Haoxiang Yang, Kun Huang, Qi Aiello, Marco Dustdar, Schahram |
| contents | 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 and a real-time operational stage. The former is solved using Benders decomposition for computational tractability, while in the latter, economic dispatch of generation assets is coupled with an adaptive CPN task scheduling managed by a deep reinforcement learning agent. It makes carbon-aware decisions by responding to dynamic grid conditions, including real-time electricity prices and marginal carbon intensity. Extensive simulations demonstrate that the TSCO outperforms baseline approaches significantly. It reduces carbon emissions by 16.2% and operational costs by 12.7%, while decreasing RES curtailment by over $60\%$, maintaining a task success rate of 98.5%, and minimizing average task tardiness to 12.3s. This work advances cross-domain service optimization in CPNs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_04015 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Novel Hierarchical Co-Optimization Framework for Coordinated Task Scheduling and Power Dispatch in Computing Power Networks Luo, Haoxiang Yang, Kun Huang, Qi Aiello, Marco Dustdar, Schahram Networking and Internet Architecture 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 and a real-time operational stage. The former is solved using Benders decomposition for computational tractability, while in the latter, economic dispatch of generation assets is coupled with an adaptive CPN task scheduling managed by a deep reinforcement learning agent. It makes carbon-aware decisions by responding to dynamic grid conditions, including real-time electricity prices and marginal carbon intensity. Extensive simulations demonstrate that the TSCO outperforms baseline approaches significantly. It reduces carbon emissions by 16.2% and operational costs by 12.7%, while decreasing RES curtailment by over $60\%$, maintaining a task success rate of 98.5%, and minimizing average task tardiness to 12.3s. This work advances cross-domain service optimization in CPNs. |
| title | A Novel Hierarchical Co-Optimization Framework for Coordinated Task Scheduling and Power Dispatch in Computing Power Networks |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2508.04015 |