Grid Scheduling using PSO with Naive Crossover

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. Thetask 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. In this paper we use the technique of PSO with Naive crossover to solve the taskscheduling problem in grid computing. The aim of using thistechnique is use the given resources optimally and assign the task to the resources efficiently. The simulated results show that PSO with Naive Crossover proves to be a better algorithm when applied to resource allocation anddisk scheduling in grid computing.