Reverse combinatorial auction-based protocols for resource selection in grids
by G.V.R. Radhanikanth, Y. Narahari
International Journal of Grid and Utility Computing (IJGUC), Vol. 1, No. 2, 2009

Abstract: Grid computing provides an extremely promising distributed paradigm for executing large-scale resource-intensive applications. Given a distributed pool of resources, a grid user is faced with the problem of selecting an optimal set of resources. We call this problem the resource selection problem and our approach to modelling and solving this problem is through a reverse combinatorial auction. The resource owners submit bids on combinations of resources or tasks in response to the grid user's request for a bundle of resources. The objective of the grid user is to minimise an appropriately defined cost function based on these bids. The resource selection problem therefore becomes the winner determination problem of the reverse combinatorial auction. Two variants of the problem are considered: (1) resource selection with task-level trading and (2) resource selection with resource-level trading. In both the cases, the resource selection problem turns out to be an integer linear programming problem. We have compared the performance of the proposed resource selection protocols against that of a cost optimisation protocol and a time optimisation protocol which are part of the Nimrod-G resource broker. The protocols proposed are found to have superior overall performance in terms of turnaround time and total cost.

Online publication date: Tue, 16-Dec-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com