A New Bidding Based Algorithm for Resource Selection in Grid Environment

A Grid system is comprised of large sets of heterogeneous and geographically distributed resources that are aggregated as a virtual computing platform for executing large-scale scientific applications. As the number of resources in Grid increases rapidly, selecting appropriate resources for tasks has become a crucial issue. The selection of resources that best fitting tasks in Grid environments is an essential and critical factor to system performance. To avoid single point of failure server overload problems, bidding provides an alternative means of resource selection in distributed systems. This paper proposes a resource selection algorithm in bidding based Grid environment to minimize the total time for task completion time arises when using non-reserved bidding algorithms. The result of Evaluation shows the task average completion time less than task average completion time in non-reserved bidding model.