Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11960/4790
Title: An energy-optimized embedded load balancing using DVFS computing in cloud data centers
Authors: Javadpour, Amir
Sangaiah, Arun Kumar
Pinto, Pedro
Ja'fari, Forough
Zhang, Weizhe
Majed Hossein Abadi, Ali
Ahmadi, HamidReza
Keywords: Cloud computing
Load balancing scheduling
DVFS
Big datacenter
SLA
Power consumption
Issue Date: 2023
Citation: Javadpour, A., Sangaiah, A. K., Pinto, P., Ja'fari, F., Zhang, W., Majed Hossein Abadi, A., & Ahmadi, H. (2023). An energy-optimized embedded load balancing using DVFS computing in cloud data centers. Computer Communications, 197, 255-266. https://doi.org/10.1016/j.comcom.2022.10.019
Abstract: Task scheduling is a significant challenge in the cloud environment as it affects the network’s performance regarding the workload of the cloud machines. It also directly impacts the consumed energy, therefore the profit of the cloud provider. This paper proposed an algorithm that prioritizes the tasks regarding their execution deadline. We also categorize the physical machines considering their configuration status. Henceforth, the proposed method assigns the jobs to the physical machines with the same priority class close to the user. Furthermore, we reduce the consumed energy of the machines processing the low-priority tasks using the DVFS method. The proposed method migrates the jobs to maintain the workload balance, or if the machines’ class changed according to their scores. We have evaluated and validated the proposed method in the CloudSim library. The simulation results demonstrate that the proposed method optimized energy consumption by 12% and power consumption by 20%.
URI: http://hdl.handle.net/20.500.11960/4790
ISSN: 0140-3664
Appears in Collections:ADiT-Lab - Publicações indexadas à WoS/Scopus
ESTG - Publicações indexadas à WoS/Scopus

Files in This Item:
File Description SizeFormat 
1-s2.0-S0140366422004078-main.pdf2.18 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.