A Genetic-Algorithm-Based Framework for Green Task Scheduling and Energy Optimization in Data Centers
Main Article Content
Abstract
Data centers already draw a fast-rising slice of global electricity, and regulators and export markets are watching their carbon footprint more closely every year. This paper presents a genetic-algorithm (GA) framework for green task scheduling that jointly minimizes energy consumption, carbon emissions, and service-level-agreement (SLA) violations across a geo-distributed data-center environment with time-varying grid carbon intensity. What sets it apart from prior carbon-aware schedulers is a dedicated carbon-data governance layer sitting underneath the optimizer: a unified data catalog, built on multi-source interoperability, that feeds the scheduler carbon-intensity signals whose source, usage, and processing history can all be checked after the fact. Each batch or deferrable task is encoded as a mapping to a server and a time slot, and the GA evolves populations of these mappings under a normalized weighted-sum fitness function using tournament selection, two-point crossover, adaptive mutation, and elitism. We test the framework in a discrete-event simulation with up to two thousand tasks and two hundred heterogeneous servers, driven by a diurnal carbon-intensity curve and Google-cluster-style workloads. Against Round-Robin, First-Fit and Best-Fit greedy heuristics, particle swarm optimization, and a carbon-agnostic GA, the proposed carbon-aware GA cuts carbon emissions by roughly eighteen to twenty-eight percent and energy consumption by twelve to twenty percent, with SLA impact staying close to negligible. Ablation and sensitivity studies point to the same conclusion: governed carbon data and careful weight tuning, together, are what make the low-carbon scheduling outcomes both strong and defensible.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
References
M. Chen, Y. Zhao, and L. Sun, “An improved genetic algorithm for task scheduling in heterogeneous cloud environments,” IEEE Trans. Cloud Comput., vol. 11, no. 2, pp. 1342–1356, 2023.
R. Kumar and S. Banerjee, “A hybrid evolutionary metaheuristic for large-scale cloud workflow scheduling,” Future Gener. Comput. Syst., vol. 128, pp. 214–229, 2022.
J. Park, H. Lee, and D. Kim, “Energy-aware virtual machine consolidation for sustainable data centers,” IEEE Trans. Sustain. Comput., vol. 7, no. 3, pp. 601–614, 2022.
A. Rossi and P. Verma, “DVFS-aware deadline-constrained scheduling for green cloud computing,” Appl. Energy, vol. 305, pp. 117–131, 2021.
S. Nakamura and T. Ito, “PUE-driven joint optimization of cooling and IT load in data centers,” IEEE Trans. Sustain. Comput., vol. 9, no. 1, pp. 88–101, 2024.
L. Fernandez, M. Oliveira, and C. Duarte, “Carbon-aware temporal shifting of deferrable data-center workloads,” IEEE Trans. Cloud Comput., vol. 12, no. 1, pp. 220–235, 2024.
Y. Wang, F. Li, and G. Tan, “Geo-distributed carbon-aware load routing for cloud services,” Future Gener. Comput. Syst., vol. 149, pp. 355–370, 2023.
E. Thompson and N. Reddy, “Particle swarm optimization for energy-efficient cloud task placement,” Appl. Energy, vol. 322, pp. 119–134, 2022.
H. Guo, J. Xu, and B. Zhou, “Multi-objective evolutionary scheduling under time-varying electricity carbon intensity,” IEEE Trans. Sustain. Comput., vol. 8, no. 4, pp. 712–726, 2023.
D. Silva and R. Costa, “Renewable-aware batch scheduling in hyperscale data centers,” IEEE Trans. Cloud Comput., vol. 13, no. 1, pp. 130–145, 2025.
X. Zhang, Q. Liu, and W. Feng, “Full-lifecycle governance of carbon data elements for the power industry,” IEEE Access, vol. 12, pp. 44210–44225, 2024.
K. Ahmed and P. Nguyen, “Data quality assurance for carbon accounting in energy systems,” Future Gener. Comput. Syst., vol. 156, pp. 90–104, 2024.
L. Moreau and J. Petit, “Secure cross-institution data sharing for carbon-aware infrastructure,” IEEE Trans. Sustain. Comput., vol. 10, no. 2, pp. 305–319, 2025.
M. Rossi and A. Bianchi, “The EU Carbon Border Adjustment Mechanism and digital services: an operator perspective,” IEEE Access, vol. 13, pp. 15220–15235, 2025.
T. Yamamoto and S. Fujita, “Adaptive genetic operators for scalable data-center scheduling,” IEEE Trans. Cloud Comput., vol. 12, no. 4, pp. 1401– 1415, 2024.