Research on Scheduling Algorithm for Workflow-Based Grid Resource

Author(s):  
Cong Chen ◽  
Yang Yu ◽  
Jinfan Lei ◽  
Youming Lin ◽  
Wenpeng Li
2011 ◽  
Vol 52-54 ◽  
pp. 1125-1130
Author(s):  
Jing Chen ◽  
Ming Xin Liu

To improve the utilization ratio of resources and the complete number of tasks, a kind of a new grid resource scheduling algorithm TWMQC (based on Task Weight and Multi-QoS Constraint) integrating multi-QoS constraint with task weight was proposed. The accomplished process of grid resource scheduling algorithm was transformed multi attribute constraints of resource and task, according to the parametric resource information and task information, classified different task weight sets based on the priority of tasks. Multi-QoS constraints of deadline of gridlets, bandwidth and CPU were defined, and the correlative algorithms were simulated by the GridSim toolkits. The simulation results show that algorithm TWMQC, which integrating multi-QoS constraint and tasks weight is superior in solving such kind of issues by comparing and analyzing the result data.


2011 ◽  
Vol 219-220 ◽  
pp. 591-595 ◽  
Author(s):  
Guang Nian Yang ◽  
Wei Qi ◽  
Jun Zhou

Now, our sewage treatment industry mainly depends on the blower of aeration act as metabolic, absorbed in the toxic substances. Blower resources management is the key issue of sewage treatment. Traditional resource scheduling algorithm exist some defects, for example it can not well meet the quality requirements and can not get the optimal solution. This article gives a new resource scheduling method based on improved genetic algorithm. It achieves grid resource scheduling by using real number encoding and activities point crossover. Experiments show that genetic algorithm can reduce executing time and task completion time, and further improve the scalability of resource scheduling model. This algorithm has stability and high efficiency in grid environment.


Author(s):  
MALARVIZHI NANDAGOPAL ◽  
S. GAJALAKSHMI ◽  
V. RHYMEND UTHARIARAJ

Computational grids have the potential for solving large-scale scientific applications using heterogeneous and geographically distributed resources. In addition to the challenges of managing and scheduling these applications, reliability challenges arise because of the unreliable nature of grid infrastructure. Two major problems that are critical to the effective utilization of computational resources are efficient scheduling of jobs and providing fault tolerance in a reliable manner. This paper addresses these problems by combining the checkpoint replication based fault tolerance mechanism with minimum total time to release (MTTR) job scheduling algorithm. TTR includes the service time of the job, waiting time in the queue, transfer of input and output data to and from the resource. The MTTR algorithm minimizes the response time by selecting a computational resource based on job requirements, job characteristics, and hardware features of the resources. The fault tolerance mechanism used here sets the job checkpoints based on the resource failure rate. If resource failure occurs, the job is restarted from its last successful state using a checkpoint file from another grid resource. Globus ToolKit is used as the grid middleware to set up a grid environment and evaluate the performance of the proposed approach. The monitoring tools Ganglia and Network Weather Service are used to gather hardware and network details, respectively. The experimental results demonstrate that, the proposed approach effectively schedule the grid jobs with fault-tolerant way thereby reduces TTR of the jobs submitted in the grid. Also, it increases the percentage of jobs completed within specified deadline and making the grid trustworthy.


Sign in / Sign up

Export Citation Format

Share Document