Combinatorial Double Auction-based Scheme for Resource Allocation in Grids

Offering Grid services in an open market determines an optimization case for finding the best suitable resource allocation for a given number of requests and existing resources. Thus, appropriate resource allocation schemes, supporting accounting, are required in addition to a pricing scheme, which supports financial fairness criteria. The newly developed Resource Allocation Model Developed for the Combinatorial Double Auction (RAMDCoDA) achieves these requirements, while being incentive compatible. Therefore, this paper introduces the mechanism, the pricing scheme, and their evaluation.

[1]  Sajal K. Das,et al.  A pricing strategy for job allocation in mobile grids using a non-cooperative bargaining theory framework , 2005, J. Parallel Distributed Comput..

[2]  T. Matsuo,et al.  An approach to avoiding shill bids based on combinatorial auction in volume discount , 2005, Rational, Robust, and Secure Negotiation Mechanisms in Multi-Agent Systems (RRS'05).

[3]  Alan Scheller-Wolf,et al.  Design of a Multi–Unit Double Auction E–Market , 2002, Comput. Intell..

[4]  Michael Schwind,et al.  Dynamic Resource Prices in a Combinatorial Grid System , 2006, The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (CEC/EEE'06).

[5]  Craig Boutilier,et al.  Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.

[6]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[7]  Stamatis Vassiliadis,et al.  Market-Based Resource Allocation in Grids , 2006, 2006 Second IEEE International Conference on e-Science and Grid Computing (e-Science'06).

[8]  Bai Wang,et al.  A Dynamic Price Model with Demand Prediction and Task Classification in Grid , 2007, Sixth International Conference on Grid and Cooperative Computing (GCC 2007).

[9]  Andrew B. Whinston,et al.  Solving the combinatorial double auction problem , 2005, Eur. J. Oper. Res..

[10]  Andrew B. Whinston,et al.  Pricing combinatorial auctions , 2004, Eur. J. Oper. Res..

[11]  Thomas Sandholm,et al.  Evaluating Demand Prediction Techniques for Computational Markets , 2006 .

[12]  Daniel Grosu,et al.  Combinatorial auction-based protocols for resource allocation in grids , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[13]  Weidong Liu,et al.  Competitive Pricing Model for Resource Scheduling in Grid Computing , 2007 .

[14]  Jan Broeckhove,et al.  A commodity market algorithm for pricing substitutable Grid resources , 2007, Future Gener. Comput. Syst..

[15]  Noam Nisan,et al.  An efficient approximate allocation algorithm for combinatorial auctions , 2001, EC '01.

[16]  Minglu Li,et al.  A Double Auction Mechanism for Resource Allocation on Grid Computing Systems , 2004, GCC.

[17]  Yang Jin,et al.  An autonomous pricing strategy toward market economy in computational grids , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.