Next Article in Journal
Metrics for Measuring Sustainable Product Design Concepts
Next Article in Special Issue
Application of the Deep CNN-Based Method in Industrial System for Wire Marking Identification
Previous Article in Journal
Experimental Study of Fuel Consumption and Exhaust Gas Composition of a Diesel Engine Powered by Biodiesel from Waste of Animal Origin
Previous Article in Special Issue
Smart Meters Time Series Clustering for Demand Response Applications in the Context of High Penetration of Renewable Energy Resources
 
 
Article

Energy Idle Aware Stochastic Lexicographic Local Searches for Precedence-Constraint Task List Scheduling on Heterogeneous Systems

1
Information Technology Engineering, Polytechnic University of Altamira, Altamira 89602, Mexico
2
División de Estudios de Posgrado, Tecnológico Nacional de México/Instituto Tecnológico de Ciudad Madero, Ciudad Madero 89440, Mexico
3
Facultad de Ingeniería Arturo Narro Siller, Universidad Autónoma de Tamaulipas, Tampico 89140, México
*
Author to whom correspondence should be addressed.
Academic Editor: Elena Gaudioso Vázquez
Energies 2021, 14(12), 3473; https://doi.org/10.3390/en14123473
Received: 6 May 2021 / Revised: 7 June 2021 / Accepted: 8 June 2021 / Published: 11 June 2021
The use of parallel applications in High-Performance Computing (HPC) demands high computing times and energy resources. Inadequate scheduling produces longer computing times which, in turn, increases energy consumption and monetary cost. Task scheduling is an NP-Hard problem; thus, several heuristics methods appear in the literature. The main approaches can be grouped into the following categories: fast heuristics, metaheuristics, and local search. Fast heuristics and metaheuristics are used when pre-scheduling times are short and long, respectively. The third is commonly used when pre-scheduling time is limited by CPU seconds or by objective function evaluations. This paper focuses on optimizing the scheduling of parallel applications, considering the energy consumption during the idle time while no tasks are executing. Additionally, we detail a comparative literature study of the performance of lexicographic variants with local searches adapted to be stochastic and aware of idle energy consumption. View Full-Text
Keywords: directed acyclic graph (DAG); scheduling; makespan; energy aware; energy idle; local search directed acyclic graph (DAG); scheduling; makespan; energy aware; energy idle; local search
Show Figures

Figure 1

MDPI and ACS Style

Santiago, A.; Ponce-Flores, M.; Terán-Villanueva, J.D.; Balderas, F.; Martínez, S.I.; Rocha, J.A.C.; Menchaca, J.L.; Berrones, M.G.T. Energy Idle Aware Stochastic Lexicographic Local Searches for Precedence-Constraint Task List Scheduling on Heterogeneous Systems. Energies 2021, 14, 3473. https://doi.org/10.3390/en14123473

AMA Style

Santiago A, Ponce-Flores M, Terán-Villanueva JD, Balderas F, Martínez SI, Rocha JAC, Menchaca JL, Berrones MGT. Energy Idle Aware Stochastic Lexicographic Local Searches for Precedence-Constraint Task List Scheduling on Heterogeneous Systems. Energies. 2021; 14(12):3473. https://doi.org/10.3390/en14123473

Chicago/Turabian Style

Santiago, Alejandro, Mirna Ponce-Flores, J. David Terán-Villanueva, Fausto Balderas, Salvador Ibarra Martínez, José Antonio Castan Rocha, Julio Laria Menchaca, and Mayra Guadalupe Treviño Berrones. 2021. "Energy Idle Aware Stochastic Lexicographic Local Searches for Precedence-Constraint Task List Scheduling on Heterogeneous Systems" Energies 14, no. 12: 3473. https://doi.org/10.3390/en14123473

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop