A Yarn-Based Energy-Aware Scheduling Method for Big Data Applications Under Deadline Constraints
Loading...
Files
Date
2022
Authors
Shabestari, Fatemeh
Rahmani, Amir Masoud
Navimipour, Nima Jafari
Jabbehdari, Sam
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
Hadoop is a distributed framework for processing big data. One of the critical parts of Hadoop is YARN, which carries out scheduling and resource management. A scheduling algorithm should consider multiple objectives. However, YARN schedulers do not consider the Service Level Agreement (SLA) and the energy-related issues. The present paper proposes an energy-efficient deadline-aware model for the scheduling problem. The scheduling issue is an NP-hard problem regarding the deadline of applications and reducing energy. Hence, an Energy-efficient Deadline-aware Scheduling Algorithm based on the Moth-Flame Optimization algorithm (EDSA-MFO) is suggested to minimize the energy consumption and execute the application within a given soft deadline. Moreover, the earliest deadline first-based (EDF-based) heuristic approach is proposed to decode a moth into a scheduling solution. The algorithm is implemented for both static and dynamic scheduling. To evaluate the performance of the proposed algorithm, extensive simulations are conducted. The outcomes demonstrated that the suggested method could find near-optimal scheduling. It outperforms the YARN default FIFO scheduler, EDF, the energy-aware greedy algorithm (EAGA), and the deadline-aware energy-efficient MapReduce scheduling algorithm for YARN (EMRSAY) in total cluster energy consumption and meeting job deadline.
Description
Keywords
Virtual Machine, Optimization, Efficiency, Algorithm, Consolidation, Management, Jobs, Virtual Machine, Optimization, Hadoop, Efficiency, Scheduling, Algorithm, Deadline, Consolidation, Energy efficiency, Management, Metaheuristic, Jobs, Moth-Flame
Turkish CoHE Thesis Center URL
Fields of Science
Citation
WoS Q
Q1
Scopus Q
Q1
Source
Journal of Grid Computing
Volume
20
Issue
4