Combinatorial Auction-Based Protocols for Resource Allocation in Grids
- 19 April 2005
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In this paper, we introduce the combinatorial auction model for resource management in grids. We propose a combinatorial auction-based resource allocation protocol in which a user bids a price value for each of the possible combinations of resources required for its tasks execution. The protocol involves an approximation algorithm for solving the combinatorial auction problem. We implement the new protocol in a simulated environment and study its economic efficiency and its effect on the system performance.Keywords
This publication has 16 references indexed in Scilit:
- A greedy grid - the grid economic engine directivePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Combinatorial Auctions: A SurveyINFORMS Journal on Computing, 2003
- G-commerce: market formulations controlling resource allocation on the computational gridPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Integer programming for combinatorial auction winner determinationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Economic models for resource management and scheduling in Grid computingConcurrency and Computation: Practice and Experience, 2002
- Algorithm for optimal winner determination in combinatorial auctionsArtificial Intelligence, 2001
- An efficient approximate allocation algorithm for combinatorial auctionsPublished by Association for Computing Machinery (ACM) ,2001
- Analyzing Market-Based Resource Allocation Strategies for the Computational GridThe International Journal of High Performance Computing Applications, 2001
- Computationally Manageable Combinational AuctionsManagement Science, 1998
- Auction allocation of computing resourcesCommunications of the ACM, 1995