DUTCH-AUCTION BASED GRID RESOURCE SCHEDULING IN VIRTUAL AUCTION SPACES

摘要

Matching the grid resource and task under the principle of supply and demand to gain maximum benefit, is a key issue in the grid research. A new algorithm named Dutch-auction based grid resource" scheduling is presented in this paper, in which the grid tasks match the resources in virtual auction spaces. At first, a scheduling framework is developed, which could provide a basis for the auction. Regional scheduling center, the core component of the framework, selects corresponding tasks from task lists to establish virtual auction spaces. In this way, resources and tasks are divided into units which could balance the network load effective ly. Then resources in different virtual auction spaces match the tasks based on the scheduling mechanism of Dutch-auction. Because the prices of the resources are descending, the time-optimize tasks could get the re sources in time at higher price, the cost-optimize tasks could get the resources in the budget by wait for more time. The credibility attribute of the resources solve the bid conflict effectively. Simulation results show that Dutch-auction based grid resource scheduling algorithm reduces the scheduling span and the cost effectively.