Grid Scheduling Using PSO with SPV Rule
Kuldeep Kaur, Sudhanshu Prakash Tiwari · 2012
Grid computing can be defined as applying the resources of many computers in a network to a problem which requires a great number of computer processing cycles or access to large amounts of data. However, in the field of grid computing scheduling of tasks is a big challenge. The task scheduling problem is the problem of assigning the tasks in the system in a manner that will optimize the overall performance of the application, while assuring the correctness of the result. Each day new algorithms are proposed for assigning tasks to the resources. This is also a boon for the grid computing. In this paper we use the technique of Particle Swarm Optimization (PSO) with SPV (Shortest position value) rule to solve the task scheduling problem in grid computing. The aim of using this technique is use the given resources optimally and assign the task to the resources efficiently. The simulated results show that PSO with SPV rule proves to be a better algorithm when applied to resource allocation and disk scheduling in grid computing.