Market-Based Resource Allocation in Grids

The core goal of resource management is to establish a mutual agreement between a resource producer and a resource consumer by which the provider agrees to supply a capability that can be used to perform some tasks on behalf of the consumer. Market-based approaches introduce money and pricing as the technique for coordination between consumers and producers of resources. In this paper, we propose a market-based mechanism to allocate computational resources (CPU time) with a single central Market in a local Grid. In such a network whenever any node can offer idle CPU time to the Grid and whenever a node has some tasks waiting for free CPU, it may request the resource from the Grid. In our approach, consumers and producers are autonomous agents that make their own decisions according to their capabilities and their local knowledge. Continuous Double Auction model is used as a technique using which these selfish agents can coordinate their work and make their decision. The performance of this mechanism is evaluated and is compared with the simple FCFS mechanism.

[1]  N. Nisan,et al.  Globally distributed computation over the Internet-the POPCORN project , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[2]  David Abramson,et al.  Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..

[3]  Martin Shubik.  Game Theory in the Social Sciences , 1982 .

[4]  Stamatis Vassiliadis,et al.  A peer-to-peer agent auction , 2002, AAMAS '02.

[5]  Michael P. Wellman,et al.  Flexible double auctions for electronic commerce: theory and implementation , 1998, Decis. Support Syst..

[6]  Tad Hogg,et al.  Spawn: A Distributed Computational Economy , 1992, IEEE Trans. Software Eng..

[7]  Martin Shubik,et al.  Game Theory and Social Science@@@Game Theory in the Social Sciences: Concepts and Solutions. , 1983 .

[8]  William E. Weihl,et al.  Lottery scheduling: flexible proportional-share resource management , 1994, OSDI '94.

[9]  Kazuhiro Kuwabara,et al.  Equilibratory Approach to Distributed Resource Allocation: Toward Coordinated Balancing , 1992, MAAMAW.

[10]  Daniel Grosu,et al.  Double auction protocols for resource allocation in grids , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[11]  Daniel Grosu,et al.  AUCTION-BASED RESOURCE ALLOCATION PROTOCOLS IN GRIDS , 2004 .

[12]  Rajkumar Buyya,et al.  AN EVALUATION OF COMMUNICATION DEMAND OF AUCTION PROTOCOLS IN GRID ENVIRONMENTS , 2006 .

[13]  Spyros Lalis,et al.  JaWS: An Open Market-Based Framework for Distributed Computing over the Internet , 2000, GRID.

[14]  G. Heal.  Planning without Prices , 1969 .

[15]  J. Plank,et al.  Grid Resource Allocation and Control Using Computational Economies , 2003 .

[16]  Francine Berman,et al.  Grid Computing: Making the Global Infrastructure a Reality , 2003 .

[17]  C. Preist,et al.  Adaptive agents in a persistent shout double auction , 1998, ICE '98.

[18]  Rahul Simha,et al.  A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems , 1989, IEEE Trans. Computers.

[19]  Richard Wolski,et al.  G-commerce: market formulations controlling resource allocation on the computational grid , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.