EUVIMEDEUVIMED entdecken
Crossref

Electricity Cost Minimization for Multi-Workflow Allocation in Geo-Distributed Data Centers

Shuang Wang, He Zhang, Tianxing Wu, Yueyou Zhang, Wei Emma Zhang, Quan Z. Sheng

IEEE Transactions on Services Computing · 2025-05 · 18 (3) · 1397-1411

DOI: 10.1109/tsc.2025.3562325 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Services Computing, 2025-05. Verfasst von Shuang Wang und 5 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 41 Literaturangaben. Gefördert von: National Key Research and Development Program of China, Natural Science Foundation of Jiangsu Province, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Worldwide, Geo-distributed Data Centers (GDCs) provide computing and storage services for massive workflow applications, resulting in high electricity costs that vary depending on geographical locations and time. How to reduce electricity costs while satisfying the deadline constraints of workflow applications is important in GDCs, which is determined by the execution time of servers, power, and electricity price. Determining the completion time of workflows with different server frequencies can be challenging, especially in scenarios with heterogeneous computing resources in GDCs. Moreover, the electricity price is also different in geographical locations and may change dynamically. To address these challenges, we develop a geo-distributed system architecture and propose an Electricity Cost aware Multiple Workflows Scheduling algorithm (ECMWS) for servers of GDCs with fixed frequency and power. ECMWS comprises four stages, namely workflow sequencing, deadline partitioning, task sequencing, and resource allocation where two graph embedding models and a policy network are constructed to solve the Markov Decision Process (MDP). After statistically calibrating parameters and algorithm components over a comprehensive set of workflow instances, the proposed algorithms are compared with the state-of-the-art methods over two types of workflow instances. The experimental results demonstrate that our proposed algorithm significantly outperforms other algorithms, achieving an improvement of over 15% while maintaining an acceptable computational time.

Förderung

  • National Key Research and Development Program of China
  • Natural Science Foundation of Jiangsu Province
  • National Natural Science Foundation of China
  • Southeast University Interdisciplinary Research Program
  • Big Data Computing Center of Southeast University

Zitieren

APA

Wang, S., Zhang, H., Wu, T., Zhang, Y., Zhang, W. E., & Sheng, Q. Z. (2025). Electricity Cost Minimization for Multi-Workflow Allocation in Geo-Distributed Data Centers. IEEE Transactions on Services Computing, 18(3), 1397-1411. https://doi.org/10.1109/tsc.2025.3562325

Vancouver

Wang S, Zhang H, Wu T, Zhang Y, Zhang WE, Sheng QZ. Electricity Cost Minimization for Multi-Workflow Allocation in Geo-Distributed Data Centers. IEEE Transactions on Services Computing. 2025;18(3):1397-1411. doi:10.1109/tsc.2025.3562325

BibTeX
@article{Wang2025,
  author = {Wang, Shuang and Zhang, He and Wu, Tianxing and Zhang, Yueyou and Zhang, Wei Emma and Sheng, Quan Z.},
  title = {Electricity Cost Minimization for Multi-Workflow Allocation in Geo-Distributed Data Centers},
  journal = {IEEE Transactions on Services Computing},
  year = {2025},
  volume = {18},
  number = {3},
  pages = {1397--1411},
  doi = {10.1109/tsc.2025.3562325}
}
Kostenlos starten →