Spawn: A Distributed Computational Economy
IEEE Transactions on Software Engineering
Auction allocation of computing resources
Communications of the ACM
An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster
IEEE Transactions on Parallel and Distributed Systems
Supporting Co-Allocation in an Auctioning-Based Resource Allocator for Grid Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Characterizing NAS Benchmark Performance on Shared Heterogeneous Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Simgrid: A Toolkit for the Simulation of Application Scheduling
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Globally Distributed Computation over the Internet - The POPCORN Project
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Condor-G: A Computation Management Agent for Multi-Institutional Grids
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Grid resource management: state of the art and future trends
Grid resource management: state of the art and future trends
Combinatorial Auction-Based Protocols for Resource Allocation in Grids
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14
Double Auction Protocols for Resource Allocation in Grids
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
Advanced reservation-based scheduling of task graphs on clusters
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Hi-index | 0.00 |
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.