Abstract
This paper introduces an algorithm whose aim is to increase scheduling efficiency on a distributed system like a Cluster Grid. In order to measure this efficiency, we have classified jobs in homogeneous classes and observed the throughput on homogeneous class of compute server. The scheduler is based on a defined Potential function applied to the Prisoner’s Dilemma problem of the Game Theory and this approach allows avoiding inefficiency caused by generic greedy scheduler policies. Moreover for this kind of games, we have verified that all Nash equilibrium solutions correspond to the Potential Function minimum.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
