By Topic

A Grid Resource Allocation Method Based on Iterative Combinatorial Auctions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Liu Xing ; Hubei Univ. of Technol., Wuhan, China ; Zhao Lan

Whereas grids enable the sharing, selection, query and aggregation of geographically distributed resources for solving large-scale problems, providing efficient resource allocation mechanism managing grid resources is a complex undertaking. In this work, we consider the problem of engineering agents that act as proxies for the procurement of computational and data resources. Since applications may require multiple grid services, mechanisms such as single-good auctions may not be appropriate for the management of these services, we propose a new scheduling algorithm based on iterative combinatorial auction. We provide the design of prices announcement, agent creation and resource situation submission, bidding rules, and temporary allocation rules. A simulation environment is established based on the Gridsim toolkit and the simulation experiments indicate that the algorithm needs less communication and meet the requirements of userpsilas QoS better than the conventional algorithms.

Published in:

Information Technology and Computer Science, 2009. ITCS 2009. International Conference on  (Volume:2 )

Date of Conference:

25-26 July 2009