View in EDS

Energy-Aware Scientific Real-Time DAG Scheduling Using Slack Reclamation in Heterogeneous DVFS Cloud Datacenters

Saved in:
Bibliographic Details
Title: Energy-Aware Scientific Real-Time DAG Scheduling Using Slack Reclamation in Heterogeneous DVFS Cloud Datacenters
Authors: Ruhullah Aliyan Nejadi, Homayun Motameni, Behnam Barzegar, Ebrahim Akbari, Ali Abbaszadeh Sori
Source: IEEE Access, Vol 13, Pp 169825-169840 (2025)
Publisher Information: IEEE, 2025.
Publication Year: 2025
Collection: LCC:Electrical engineering. Electronics. Nuclear engineering
Subject Terms: Service level agreement, power efficiency, real time DAG scheduling, DVFS, Electrical engineering. Electronics. Nuclear engineering, TK1-9971
Description: Provision of a high level of Quality of Services (QOS) to end users in a cost-effective way with minimum power consumption and minimum Service Level Agreement (SLA) violation is one of the main challenges facing cloud service providers. Accordingly, this paper presents an energy-efficient scheduling strategy in SLA-Aware and cost-effective manner for real-time scheduling of parallel tasks modeled as Directed Acyclic Graphs (DAG) in cloud environment. The proposed approach utilizes Dynamic Voltage and Frequency Scaling (DVFS) capability which has been incorporated into recent commodity multi-core processors to fill the gaps within schedule. The aim is to develop an energy-aware strategy which, besides yielding accurate results, maintains the high quality of the delivered services in a standard and financially rational manner. The proposed scheduling algorithm is compared with other basic strategies in terms of different service quality requirements. The performed experiments demonstrate that the proposed approach outperforms existing methods and can be vowed as a promising scheduling strategy. Thirdly, a novel algorithm to find the best combination of frequencies to result the optimal energy is presented. The proposed algorithm has been evaluated based on results obtained from experiments with three different sets of task graphs: 3000 randomly generated task graphs, and 600 task graphs for two popular applications (Gauss–Jordan and Lower and Upper (LU) decomposition). The results show the superiority of the proposed algorithm in comparison with other techniques.
Document Type: article
File Description: electronic resource
Language: English
ISSN: 2169-3536
Relation: https://ieeexplore.ieee.org/document/11180912/; https://doaj.org/toc/2169-3536
DOI: 10.1109/ACCESS.2025.3614754
Access URL: https://doaj.org/article/5cb52f10beae410b8bf666708756f2b7
Accession Number: edsdoj.5cb52f10beae410b8bf666708756f2b7
Database: Directory of Open Access Journals
Description
Abstract:Provision of a high level of Quality of Services (QOS) to end users in a cost-effective way with minimum power consumption and minimum Service Level Agreement (SLA) violation is one of the main challenges facing cloud service providers. Accordingly, this paper presents an energy-efficient scheduling strategy in SLA-Aware and cost-effective manner for real-time scheduling of parallel tasks modeled as Directed Acyclic Graphs (DAG) in cloud environment. The proposed approach utilizes Dynamic Voltage and Frequency Scaling (DVFS) capability which has been incorporated into recent commodity multi-core processors to fill the gaps within schedule. The aim is to develop an energy-aware strategy which, besides yielding accurate results, maintains the high quality of the delivered services in a standard and financially rational manner. The proposed scheduling algorithm is compared with other basic strategies in terms of different service quality requirements. The performed experiments demonstrate that the proposed approach outperforms existing methods and can be vowed as a promising scheduling strategy. Thirdly, a novel algorithm to find the best combination of frequencies to result the optimal energy is presented. The proposed algorithm has been evaluated based on results obtained from experiments with three different sets of task graphs: 3000 randomly generated task graphs, and 600 task graphs for two popular applications (Gauss–Jordan and Lower and Upper (LU) decomposition). The results show the superiority of the proposed algorithm in comparison with other techniques.
ISSN:21693536
DOI:10.1109/ACCESS.2025.3614754