Pareto Approximation Empirical Results of Energy-Aware Optimization for Precedence-Constrained Task Scheduling Considering Switching Off Completely Idle Machines

José Antonio Castán Rocha, Alejandro Santiago (), Alejandro H. García-Ruiz, Jesús David Terán-Villanueva, Salvador Ibarra Martínez and Mayra Guadalupe Treviño Berrones
Additional contact information
José Antonio Castán Rocha: Faculty of Engineering Tampico, Autonomous University of Tamaulipas, Centro Universitario Sur, Tampico 89109, Mexico
Alejandro Santiago: Faculty of Engineering Tampico, Autonomous University of Tamaulipas, Centro Universitario Sur, Tampico 89109, Mexico
Alejandro H. García-Ruiz: Faculty of Engineering Tampico, Autonomous University of Tamaulipas, Centro Universitario Sur, Tampico 89109, Mexico
Jesús David Terán-Villanueva: Faculty of Engineering Tampico, Autonomous University of Tamaulipas, Centro Universitario Sur, Tampico 89109, Mexico
Salvador Ibarra Martínez: Faculty of Engineering Tampico, Autonomous University of Tamaulipas, Centro Universitario Sur, Tampico 89109, Mexico
Mayra Guadalupe Treviño Berrones: Faculty of Engineering Tampico, Autonomous University of Tamaulipas, Centro Universitario Sur, Tampico 89109, Mexico

Mathematics, 2024, vol. 12, issue 23, 1-53

Abstract: Recent advances in cloud computing, large language models, and deep learning have started a race to create massive High-Performance Computing (HPC) centers worldwide. These centers increase in energy consumption proportionally to their computing capabilities; for example, according to the top 500 organization, the HPC centers Frontier, Aurora, and Super Computer Fugaku report energy consumptions of 22,786 kW, 38,698 kW, and 29,899 kW, respectively. Currently, energy-aware scheduling is a topic of interest to many researchers. However, as far as we know, this work is the first approach considering the idle energy consumption by the HPC units and the possibility of turning off unused units entirely, driven by a quantitative objective function. We found that even when turning off unused machines, the objectives of makespan and energy consumption still conflict and, therefore, their multi-objective optimization nature. This work presents empirical results for AGEMOEA, AGEMOEA2, GWASFGA, MOCell, MOMBI, MOMBI2, NSGA2, and SMS-EMOA. The best-performing algorithm is MOCell for the 400 real scheduling problem tests. In contrast, the best-performing algorithm is GWASFGA for a small-instance synthetic testbed.

Keywords: parallel applications; task scheduling; heterogeneous computing; directed acyclic graph; energy aware; energy idle; precedence–constraint; makespan; multi-objective optimization; evolutionary algorithms (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/23/3733/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/23/3733/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:23:p:3733-:d:1531178

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().