Dynamic Scheduling Algorithms for Workflow Applications in Grid Environment

Author(s):  
Alina Simion ◽  
Dragos Sbirlea ◽  
Florin Pop ◽  
Valentin Cristea
2010 ◽  
Vol 2 (1) ◽  
pp. 34-50 ◽  
Author(s):  
Nikolaos Preve

Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this article is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.


2014 ◽  
Vol 20 (6) ◽  
pp. 893-906 ◽  
Author(s):  
Paul A. Navratil ◽  
Hank Childs ◽  
Donald S. Fussell ◽  
Calvin Lin

2011 ◽  
Vol 27 (8) ◽  
pp. 991-998 ◽  
Author(s):  
Yun-Han Lee ◽  
Seiven Leu ◽  
Ruay-Shiung Chang

2013 ◽  
Vol 321-324 ◽  
pp. 2507-2513
Author(s):  
Zhong Ping Zhang ◽  
Li Juan Wen

In the grid environment, there are a large number of grid resources scheduling algorithms. According to the existing Min-Min scheduling algorithm in uneven load, and low resource utilization rate, we put forward the LoBa-Min-Min algorithm, which is based on load balance. This algorithm first used Min-Min algorithm preliminary scheduling, then according to the standard of reducing Makespan, the tasks on heavy-loaded resources would be assigned to resources that need less time to load balance, raise resource utilization rate, and achieve lesser completion time. At last, we used benchmark of instance proposed by Braun et al. to prove feasibility and effectiveness of the algorithm.


Author(s):  
Dinkan Patel ◽  
Anjuman Ranavadiya

Cloud Computing is a type of Internet model that enables convenient, on-demand resources that can be used rapidly and with minimum effort. Cloud Computing can be IaaS, PaaS or SaaS. Scheduling of these tasks is important so that resources can be utilized efficiently with minimum time which in turn gives better performance. Real time tasks require dynamic scheduling as tasks cannot be known in advance as in static scheduling approach. There are different task scheduling algorithms that can be utilized to increase the performance in real time and performing these on virtual machines can prove to be useful. Here a review of various task scheduling algorithms is done which can be used to perform the task and allocate resources so that performance can be increased.


Sign in / Sign up

Export Citation Format

Share Document