$$\varvec{Q}ET$$ Q E T : a QoS-based energy-aware task scheduling method in cloud environment

2017 ◽  
Vol 20 (4) ◽  
pp. 3199-3212 ◽  
Author(s):  
Shengjun Xue ◽  
Yiyun Zhang ◽  
Xiaolong Xu ◽  
Guowen Xing ◽  
Haolong Xiang ◽  
...  
2019 ◽  
Vol 8 (3) ◽  
pp. 3608-3613

There are various enhancements in the world of technology. Among that Cloud computing delivers numerous amenities over the Internet. It employs data centers which comprise hardware and software provision for loading, servers, and systems. The primary reason for the popularity of Cloud computing is consistent performance, economical operation, prompt accessibility, rapid scaling and much more. The chief cause for concern in cloud computing are the errors that happen either in the software or the hardware and energy consumption on a large scale. The clients pay only for resources utilized by them and assets which are accessible during the computing in a cloud setting. In the environment of cloud computing, Task scheduling is significant concepts which can be used to minimize the energy and time spent. The algorithms in Task scheduling might employ various measures toward dispense preference to subtasks that may generate many schedules to the divergent computing structure. Moreover, consumption of energy could be dissimilar for every source which is allocated to a job. This present research explores that the PSO-CA based energy aware task scheduling method can predict with the aim to enhance the resource distribution.


Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.


Sign in / Sign up

Export Citation Format

Share Document