loading...
Combinatorial Auction-Based Protocols for Resource Allocation in Grids
Denver, Colorado April 04-April 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2005.14019th IEEE International Parallel and ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Anubhav Das, Wayne State University, Detroit, MI
Daniel Grosu, Wayne State University, Detroit, MI
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.
Citation:
Anubhav Das, Daniel Grosu, "Combinatorial Auction-Based Protocols for Resource Allocation in Grids," ipdps, vol. 14, pp.251a, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13, 2005
Usage of this product signifies your acceptance of the Terms of Use.