Priority Based Job Scheduling using Nash Equilibrium Strategy for Grid Computing
Dharamendra Chouhan, S.M. Dilip Kumar, Jerry Antony Ajay
Journal of Networking Technology, Vol. 3, No. 4, 2012.
DOI: 
Link: http://www.dline.info/jnt/fulltext/v3n4/3.pdf
Abstract:
Effective and efficient job scheduling is an important aspect of Grid computing. Task scheduling becomes more complicated in a Grid environment, due to geographically distribution, heterogeneity and dynamic nature of grid resources. In this paper, a new computational job scheduling policy based on Nash Equilibrium is proposed. The jobs are put into scheduling queue based on priority. This priority is computed by the amount the grid user is willing to pay. Our solution is based on the Nash Bargaining Solution which provides a Pareto optimal solution for the distributed system and is also a fair solution to the problem under consideration. One of the goals of our work is to provide fairness to the customers i.e., all the users and their jobs should experience approximately equal expected response time which includes the expected queuing delay, processing time, and communication delay. As another part of our goal, we try to maximize the revenue levels for the grid owners. This scheduling policy is simulated using Alea GridSim toolkit to test the performance.