Maximum Utility Meta-Scheduling Algorithm for Economy Based Scheduling under Grid Computing

Abstract

In this paper, an economy-based Grid algorithm named as maximum utility (MU) has been presented. The algorithm maximizes the utility for all of the users. The maximum utility for the resource provider indicates the higher profit and for the resource consumers the maximum utility indicates successful execution of users processes with the lower cost of execution. Thus the utility results in the better incentives to the users. The algorithm uses the market based parameters to determine the utility value for both the resource consumers and the resource providers. Two parameters, loss factor and net savings, have been used to characterize the utility values for resource providers and resource consumers. Besides cost of execution, the algorithm uses the past performance of resource providers before allocating a new process. The algorithm uses a parameter called reputation point that will be credited to the resource provider’s account after successful completion of a process. A hierarchical decentralized scheduling framework is also proposed for better performance of scheduling algorithms.