EPTS: Energy-saving pre-emptive task scheduling for homogeneous cloud systems

2021 ◽  
Vol 24 (8) ◽  
pp. 2415-2441
Author(s):  
Mahendra Kumar Gourisaria ◽  
Pabitra Mohan Khilar ◽  
Sudhansu Shekhar Patra
2021 ◽  
Vol 224 ◽  
pp. 107050
Author(s):  
Chunlin Li ◽  
Jun Liu ◽  
Weigang Li ◽  
Youlong Luo

Author(s):  
Ismail M. Ali ◽  
Karam M. Sallam ◽  
Nour Moustafa ◽  
Ripon Chakraborty ◽  
Michael J. Ryan ◽  
...  

Kybernetes ◽  
2015 ◽  
Vol 44 (10) ◽  
pp. 1455-1471 ◽  
Author(s):  
Mehran Ashouraie ◽  
Nima Jafari Navimipour

Purpose – Expert Cloud as a new class of Cloud systems provides the knowledge and skills of human resources (HRs) as a service using Cloud concepts. Task scheduling in the Expert Cloud is a vital part that assigns tasks to suitable resources for execution. The purpose of this paper is to propose a method based on genetic algorithm to consider the priority of arriving tasks and the heterogeneity of HRs. Also, to simulate a real world situation, the authors consider the human-based features of resources like trust, reputation and etc. Design/methodology/approach – As it is NP-Complete to schedule tasks to obtain the minimum makespan and the success of genetic algorithm in optimization and NP-Complete problems, the authors used a genetic algorithm to schedule the tasks on HRs in the Expert Cloud. In this method, chromosome or candidate solutions are represented by a vector; fitness function is calculated based on several factors; one point cross-over and swap mutation are also used. Findings – The obtained results demonstrated the efficiency of the proposed algorithm in terms of time complexity, task fail rate and HRs utilization. Originality/value – In this paper the task scheduling issue in the Expert Cloud and improving pervious algorithm are pointed out and the approach to resolve the problem is applied into a practical example.


2017 ◽  
Vol 21 (2) ◽  
pp. 241-259 ◽  
Author(s):  
Sanjaya K. Panda ◽  
Indrajeet Gupta ◽  
Prasanta K. Jana

2021 ◽  
Vol 13 (5) ◽  
pp. 75-87
Author(s):  
Linz Tom ◽  
Bindu V.R.

Cloud computing has an indispensable role in the modern digital scenario. The fundamental challenge of cloud systems is to accommodate user requirements which keep on varying. This dynamic cloud environment demands the necessity of complex algorithms to resolve the trouble of task allotment. The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms. The dynamic property of cloud systems makes it challenging to find an optimal solution satisfying all the evaluation metrics. The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time. In this work, the advantages of both algorithms are incorporated to improve the makespan of user tasks.


Sign in / Sign up

Export Citation Format

Share Document