Grid Resource Allocation and Control Using Computational Economies

In this chapter, we describe the use of economic principles as the basis for Grid resource allocation policies and mechanisms. A computational economy in which users “buy” resources from their owners is an attractive method of controlling Grid resource allocation for several reasons. Economies are intuitively easy to understand, they fit the model of flexible resource usage under local control (which is fundamental to Grid computing), and they can be analyzed through a considerable body of extant theory. We discuss many of the fundamental characteristics of computational economies, particularly as they pertain to Grid computing. We also present G-commerce — a framework that we have used to investigate Grid resource economies — as an example of the type of results that are possible. Finally, we discuss several of the issues associated with empirical investigation of Grid economies as a motivation for future work.

[1]  Léon Walras.  Éléments d'économie politique pure , 1889 .

[2]  B. Curtis Eaves,et al.  Homotopies for computation of fixed points , 1972, Math. Program..

[3]  Francesco Mallegni,et al.  The Computation of Economic Equilibria , 1973 .

[4]  Herbert E. Scarf,et al.  The Computation of Economic Equilibria , 1974 .

[5]  S. Smale.  Dynamics in General Equilibrium Theory , 1976 .

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

[7]  James C. French,et al.  Legion: The Next Logical Step Toward a Nationwide Virtual Computer , 1994 .

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

[9]  Joseph M. Ostroy,et al.  Perfect competition as he blueprint for e ciency and incentive compatibility , 1995 .

[10]  Francine Berman,et al.  Application-Level Scheduling on Distributed Heterogeneous Networks , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[11]  Henri Casanova,et al.  NetSovle: A Network Server for Solving Computational Science Problems , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[12]  Alexander Reinefeld,et al.  MARS - A framework for minimizing the job execution time in a metacomputing environment , 1996, Future Gener. Comput. Syst..

[13]  Michael P. Wellman,et al.  Market-oriented programming: some early lessons , 1996 .

[14]  Ian T. Foster,et al.  Globus: a Metacomputing Infrastructure Toolkit , 1997, Int. J. High Perform. Comput. Appl..

[15]  Rajesh Raman,et al.  Matchmaking: distributed resource management for high throughput computing , 1998, Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244).

[16]  N. Nisan,et al.  The POPCORN market—an online market for computational resources , 1998, ICE '98.

[17]  Mitsuhisa Sato,et al.  Utilizing the Metaserver Architecture in the Ninf Global Computing System , 1998, HPCN Europe.

[18]  Daniela Rus,et al.  Market-based resource control for mobile agents , 1998, AGENTS '98.

[19]  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).

[20]  Yoav Shoham,et al.  Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.

[21]  David Abramson,et al.  High performance parametric modeling with Nimrod/G: killer application for the global grid? , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[22]  Ian Foster,et al.  A quality of service architecture that combines resource reservation and application adaptation , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[23]  David E. Culler,et al.  Market-based Proportional Resource Sharing for Clusters , 2000 .

[24]  Noam Nisan,et al.  The POPCORN market. Online markets for computational resources , 2000, Decis. Support Syst..

[25]  Francine Berman,et al.  The AppLeS Parameter Sweep Template: User-Level Middleware for the Grid , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[26]  David C. Parkes,et al.  Iterative Combinatorial Auctions: Theory and Practice , 2000, AAAI/IAAI.

[27]  Richard Wolski,et al.  Analyzing Market-Based Resource Allocation Strategies for the Computational Grid , 2001, Int. J. High Perform. Comput. Appl..

[28]  Michael P. Wellman,et al.  Auction Protocols for Decentralized Scheduling , 2001, Games Econ. Behav..

[29]  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.

[30]  Francine Berman,et al.  The GrADS Project: Software Support for High-Level Grid Application Development , 2001, Int. J. High Perform. Comput. Appl..

[31]  Sathish S. Vadhiyar,et al.  Numerical Libraries and the Grid , 2001, Int. J. High Perform. Comput. Appl..

[32]  David Levine,et al.  CABOB: A Fast Optimal Algorithm for Combinatorial Auctions , 2001, IJCAI.

[33]  Rajkumar Buyya,et al.  Economic-based Distributed Resource Management and Scheduling for Grid Computing , 2002, ArXiv.

[34]  Subhash Suri,et al.  Optimal Clearing of Supply/Demand Curves , 2002 .

[35]  Robert W. Crandall,et al.  Broadband: Should We Regulate High-Speed Internet Access? , 2002 .