scholarly journals Minimizing Energy Consumption Scheduling Algorithm of Workflows With Cost Budget Constraint on Heterogeneous Cloud Computing Systems

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 205099-205110
Author(s):  
Longxin Zhang ◽  
Lan Wang ◽  
Zhicheng Wen ◽  
Mansheng Xiao ◽  
Junfeng Man
Author(s):  
Poria Pirozmand ◽  
Ali Asghar Rahmani Hosseinabadi ◽  
Maedeh Farrokhzad ◽  
Mehdi Sadeghilalimi ◽  
Seyedsaeid Mirkamali ◽  
...  

AbstractThe cloud computing systems are sorts of shared collateral structure which has been in demand from its inception. In these systems, clients are able to access existing services based on their needs and without knowing where the service is located and how it is delivered, and only pay for the service used. Like other systems, there are challenges in the cloud computing system. Because of a wide array of clients and the variety of services available in this system, it can be said that the issue of scheduling and, of course, energy consumption is essential challenge of this system. Therefore, it should be properly provided to users, which minimizes both the cost of the provider and consumer and the energy consumption, and this requires the use of an optimal scheduling algorithm. In this paper, we present a two-step hybrid method for scheduling tasks aware of energy and time called Genetic Algorithm and Energy-Conscious Scheduling Heuristic based on the Genetic Algorithm. The first step involves prioritizing tasks, and the second step consists of assigning tasks to the processor. We prioritized tasks and generated primary chromosomes, and used the Energy-Conscious Scheduling Heuristic model, which is an energy-conscious model, to assign tasks to the processor. As the simulation results show, these results demonstrate that the proposed algorithm has been able to outperform other methods.


2014 ◽  
Vol 1046 ◽  
pp. 508-511
Author(s):  
Jian Rong Zhu ◽  
Yi Zhuang ◽  
Jing Li ◽  
Wei Zhu

How to reduce energy consumption while improving utility of datacenter is one of the key technologies in the cloud computing environment. In this paper, we use energy consumption and utility of data center as objective functions to set up a virtual machine scheduling model based on multi-objective optimization VMSA-MOP, and design a virtual machine scheduling algorithm based on NSGA-2 to solve the model. Experimental results show that compared with other virtual machine scheduling algorithms, our algorithm can obtain relatively optimal scheduling results.


2014 ◽  
Vol 986-987 ◽  
pp. 1383-1386
Author(s):  
Zhen Xing Yang ◽  
He Guo ◽  
Yu Long Yu ◽  
Yu Xin Wang

Cloud computing is a new emerging paradigm which delivers an infrastructure, platform and software as services in a pay-as-you-go model. However, with the development of cloud computing, the large-scale data centers consume huge amounts of electrical energy resulting in high operational costs and environment problem. Nevertheless, existing energy-saving algorithms based on live migration don’t consider the migration energy consumption, and most of which are designed for homogeneous cloud environment. In this paper, we take the first step to model energy consumption in heterogeneous cloud environment with migration energy consumption. Based on this energy model, we design energy-saving Best fit decreasing (ESBFD) algorithm and energy-saving first fit decreasing (ESFFD) algorithm. We further provide results of several experiments using traces from PlanetLab in CloudSim. The experiments show that the proposed algorithms can effectively reduce the energy consumption of data center in the heterogeneous cloud environment compared to existing algorithms like NEA, DVFS, ST (Single Threshold) and DT (Double Threshold).


2021 ◽  
Vol 11 (20) ◽  
pp. 9360
Author(s):  
Kaibin Li ◽  
Zhiping Peng ◽  
Delong Cui ◽  
Qirui Li

Task scheduling is key to performance optimization and resource management in cloud computing systems. Because of its complexity, it has been defined as an NP problem. We introduce an online scheme to solve the problem of task scheduling under a dynamic load in the cloud environment. After analyzing the process, we propose a server level agreement constraint adaptive online task scheduling algorithm based on double deep Q-learning (SLA-DQTS) to reduce the makespan, cost, and average overdue time under the constraints of virtual machine (VM) resources and deadlines. In the algorithm, we prevent the change of the model input dimension with the number of VMs by taking the Gaussian distribution of related parameters as a part of the state space. Through the design of the reward function, the model can be optimized for different goals and task loads. We evaluate the performance of the algorithm by comparing it with three heuristic algorithms (Min-Min, random, and round robin) under different loads. The results show that the algorithm in this paper can achieve similar or better results than the comparison algorithms at a lower cost.


Sign in / Sign up

Export Citation Format

Share Document