Load Balancing in Partner-Based Scheduling Algorithm for Grid Workflow
نویسندگان
چکیده
Automated advance reservation has the potential to ensure a good scheduling solution in computational Grids. To improve global throughput of Grid system and enhance resource utilization, workload has to be distributed among the resources of the Grid evenly. This paper discusses the problem of load distribution and resource utilization in heterogeneous Grids in advance reservation environment. We have proposed an extension of Partner Based Dynamic Critical Path for Grids algorithm named Balanced Partner Based Dynamic Critical Path for Grids (B-PDCPG) that incorporates a hybrid and threshold based mechanism to achieve load balancing to an allowed value of variation in workload among the resources in Partner Based Dynamic Critical Path for Grids algorithm. The proposed load balancing technique uses Utilization Profiles to store the reservation details and check the loads from these profiles on each of the resources and links. The load is distributed among resources based on the processing element capacity and number of processing units on resources. The simulation results, using Gridsim simulation engine, show that the proposed technique has balanced the workload very effectively and has provided better utilization of resources while decreasing the workflow makespan. Keywords—Load Balancing; Advance Reservation; Resource Utilization; Workflow Scheduling; Job Distribution
منابع مشابه
A Throughput Maximisation Strategy for Scheduling Transaction Intensive Workflows on SwinDeW-G
With the rapid development of e-business, workflow systems now have to deal with transaction intensive workflows whose main characteristic is the huge number of concurrent workflow instances. For such workflows, it is important to maximise the overall throughput to provide good quality of service. However, most existing scheduling algorithms are designed for scheduling of a single complex scien...
متن کاملAdaptive Job Scheduling with Load Balancing for Workflow Application in Grid Platform
Grid computing servers as the globally connected systems which performs high computing in many practical applications. Scheduling plays a key role in providing performance for grid workflow applications. Various scheduling strategies are proposed, including static scheduling strategies which map jobs to resources before execution time, or dynamic alternatives which schedule individual job only ...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملA Double Min Min Algorithm for Task Metascheduler on Hypercubic P2P Grid Systems
Most of the existing solutions on task scheduling and resource management in grid computing are based on the traditional client/ server model, enforcing a homogeneous policy on making decisions and limiting the flexibility, unpredictable reliability and scalability of the system. Thus, we need well organized system architecture to provide high system availability with task scheduling scheme for...
متن کامل