Deadline Constrained Energy-Efficient Workflow Scheduling Heuristic for Cloud

Author(s):  
Shalu Saharawat ◽  
Mala Kalra
Author(s):  
Ritu Garg ◽  
Neha Shukla

Cloud computing makes utility computing possible with pay as you go model. It virtualizes the systems by polling and sharing the resources, thus we need to handle more than one workflow at the same time. Workflow is the standard to represent compute intensive applications in scientific and engineering domain. Hence, in this article, the authors presented the scheduling heuristic for multiple workflows running parallel in the cloud environment with the aim to reduce the energy consumption as it is one of the major concerns of cloud data centers along with the execution performance. In the proposed approach, first clustering is performed to minimize the energy consumption and execution time during communication corresponding to precedence constraint tasks. Then cluster are scheduled is on the best available energy efficient resources. Finally, DVFS is applied in order to reduce energy consumption further when the nodes are in the idle and communication stage. The simulation has been performed on CloudSim and the results show the reduction in energy consumption by up to 42%.


2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
Wei Zheng ◽  
Chen Wang ◽  
Dongzhan Zhang

In cloud systems consisting of heterogeneous distributed resources, scheduling plays a key role to obtain good performance when complex applications are run. However, there is unavoidable error in predicting individual task execution times and data transmission times. When this error is being not negligible, deterministic scheduling approaches (i.e., scheduling based on accurate time prediction) may suffer. In this paper, we assume the error in time predictions is modelled in stochastic manner, and a novel randomization approach making use of the properties of random variables is proposed to improve deterministic scheduling. The randomization approach is applied to a classic deterministic scheduling heuristic, but its applicability is not limited to this one heuristic. Evaluation results obtained from extensive simulation show that the randomized scheduling approach can significantly outperform its static counterpart and the extra overhead introduced is not only controllable but also acceptable.


2018 ◽  
Vol 31 (8) ◽  
pp. e4949 ◽  
Author(s):  
Attiqa Rehman ◽  
Syed S. Hussain ◽  
Zia Rehman ◽  
Seemal Zia ◽  
Shahaboddin Shamshirband

Sign in / Sign up

Export Citation Format

Share Document