scholarly journals An efficient Task Scheduling Algorithm using Modified Whale Optimization Algorithm in Cloud Computing

2019 ◽  
Vol 9 (2) ◽  
pp. 2533-2537
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Optimization Problems ◽  
Scheduling Algorithm ◽  
Optimization Techniques ◽  
Algorithm Optimization ◽  
On Demand ◽  
Task Scheduling Algorithm ◽  
Whale Optimization ◽  
User Tasks

Cloud computing brings computing resources such as software and hardware, it serve service to the users through a network. Major concept of cloud computing is to share the marvellous storage section. In cloud computing, the user jobs are prepared and executed with appropriate resources to successfully deliver the services. There are large amount of task allocation techniques that are used to accomplish task planning. In order to improve the task scheduling technique, so we proposed method of efficient task scheduling algorithm. Optimization techniques are solving NP-hard problems is very famous. In this proposed technique, user tasks are stored in the order of queue methods. The priority is designed and allocated suitable resources for the task. New tasks are investigated and kept in the on-demand priority of queue. The output of the on-demand queue is given to the MWOA. It has been proved that this algorithm is capable to eliminate optimization problems and outperform the current algorithms. The method is proposed to the required more number of iterations is reduced. The proposed algorithm is compared with various scheduling algorithms such as, genetic algorithm, ant colony, standard grey wolf optimization and particle swarm optimization. The outcomes of tests indicate the better efficiency of the MWOA in expressions of makespan and energy consumption.

scholarly journals Alts: An Adaptive Load Balanced Task Scheduling Approach for Cloud Computing

Processes ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 1514
Author(s):  
Aroosa Mubeen ◽  
Muhammad Ibrahim ◽  
Nargis Bibi ◽  
Mohammad Baz ◽  
Habib Hamam ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Resource Utilization ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Problem Size ◽  
Cloud Data ◽  
Sla Violation ◽  
Task Scheduling Algorithm ◽  
User Tasks ◽  
Load Balanced

According to the research, many task scheduling approaches have been proposed like GA, ACO, etc., which have improved the performance of the cloud data centers concerning various scheduling parameters. The task scheduling problem is NP-hard, as the key reason is the number of solutions/combinations grows exponentially with the problem size, e.g., the number of tasks and the number of computing resources. Thus, it is always challenging to have complete optimal scheduling of the user tasks. In this research, we proposed an adaptive load-balanced task scheduling (ALTS) approach for cloud computing. The proposed task scheduling algorithm maps all incoming tasks to the available VMs in a load-balanced way to reduce the makespan, maximize resource utilization, and adaptively minimize the SLA violation. The performance of the proposed task scheduling algorithm is evaluated and compared with the state-of-the-art task scheduling ACO, GA, and GAACO approaches concerning average resource utilization (ARUR), Makespan, and SLA violation. The proposed approach has revealed significant improvements concerning the makespan, SLA violation, and resource utilization against the compared approaches.

Task scheduling algorithm based on improved genetic algorithm in cloud computing environment

2020 ◽  
Vol 13 ◽  
Author(s):  
Ge Weiqing ◽  
Cui Yanru
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Task Completion ◽  
Improved Genetic Algorithm ◽  
Fitness Functions ◽  
Task Scheduling Algorithm ◽  
Simulation Results

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.

Sign in / Sign up

Export Citation Format

Share Document