A Decentralized Utility-based Scheduling Algorithm for Grids

Abstract. Grid systems have gain tremendous importance in past years since application requirements increased drastically. The heterogeneity and geographic dispersion of grid resources and applications places some difficult challenges such as job scheduling. A scheduling algorithm tries to find a resource for a job that fulfills the job’s requirements while optimizing a given objective function. Utility is a measure of a user’s satisfaction that can be seen as a objective function that a scheduler tries to maximize. Many utility as an objective scheduling algorithms have been proposed. However, the proposed algorithms do not consider partial requirement satisfaction by awarding an utility based on the to-tal fulfillment of the requirement and follow centralized or hierarchical approaches suffer problems concerning scalability and fault tolerance. Our solution proposes a decentralized scheduling architecture with util-ity based scheduling algorithm that considers partial requirements satis-faction to overcome the shortcomings of actual solutions