scholarly journals Deadline Aware Prioritized Task Scheduling Algorithm in Cloud Computing

Cloud Computing is a computing Paradigm in which services are provided by service providers on pay-per-use. Task Scheduling is the challenging issue in cloud computing. Task scheduling refers to allocating tasks to available resources to achieve better performance of the system. Here we have proposed a Heuristics algorithm to schedule tasks in given resources which satisfies the QoS of system taking Priority and Deadline of tasks as parameters. Our algorithm is compared with existing algorithms like EDF and TLD algorithms. Our algorithm provides better makespan, increases throughput and utilize resources well compared to existing algorithms

Author(s):  
Ge Weiqing ◽  
Cui Yanru

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.


Author(s):  
S. Magesh Kumar ◽  
V. Auxilia Osvin Nancy ◽  
A Balasundaram ◽  
Seena Naik korra ◽  
D Kothandaraman ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document