Gridmarket: A Practical, Efficient Market Balancing Resource for Grid and P2P Computing

  • Ming Chen
  • Guangwen Yang
  • Xuezheng Liu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3033)


The emergency of computational Grid and Peer-to-Peer (P2P) computing system is promising to us. It challenges us to build a system to maximize collective utilities through presumed participants’ rational behavior. Although economic theories sound reasonable, many existent or proposed solutions based on that face problem of feasibility in practice. This paper proposes Gridmarket: an infrastructure relying on resource standardization, continuous double auction, and straightforward pricing algorithms which are based on price elasticity inherent in consumers and suppliers. Gridmarket efficiently equates resource’s demand with supply through continuous double auction and price tracing mechanism in the required price ranges. Software agent employing Gridmarket’s schedule is easy to write. To demonstrate its efficacy and efficiency, we have designed, built a simulation prototype and found the experiments promising.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Smith, A.: An Inquiry into the Nature and Causes of the Wealth of Nations (1776)Google Scholar
  2. 2.
    Buyya, R., Abramson, D., Giddy, J., Stockinger, H.: Economic Models for Resource Management and Scheduling in Grid Computing. Special Issue on Grid Computing Environments, The Journal of Concurrency and Computation: Practice and Experience (CCPE), Waldspurger, C. (ed.), May 2002, Wiley Press (2002)Google Scholar
  3. 3.
    Heiser, G., Lam, F., Russell, S.: Resource Management in the Mungi Single-Address-Space Operating System. In: Proceedings of Australasian Computer Science Conference, Perth Australia, February 4-6, Springer, Singapore (1998)Google Scholar
  4. 4.
    Amir, Y., Awerbuch, B., Barak, A., Borgstrom, A.S., Keren, A.: An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster. IEEE Transactions on Parallel and Distributed Systems 11(7), 760–768 (2000)CrossRefGoogle Scholar
  5. 5.
    Hogg, Huberman, B., Kephart, J., Stornetta, W.: Spawn: A Distributed Computational Economy. IEEE Transactions on Software Engineering 18(2), 103–117 (1992)CrossRefGoogle Scholar
  6. 6.
    Vickrey, W.: Counter-speculation, auctions, and competitive sealed tenders. Journal of Finance 16(1), 9–37 (1961)CrossRefGoogle Scholar
  7. 7.
    Chun, B., Culler, D.: Market-based proportional resource sharing for clusters, Technical Report CSD-1092, University of California, Berkeley, USA (January 2000)Google Scholar
  8. 8.
    Lalis, S., Karipidis, A.: An Open Market-Based Framework for Distributed Computing over the Internet. In: Proceedings of the First IEEE/ACM International Workshop on Grid Computing (GRID 2000), Bangalore, India, December 17, Springer, Heidelberg (2000)Google Scholar
  9. 9.
    Reynolds, K.: The Double Auction, Agorics, Inc. (1996),
  10. 10.
    Mojo Nation (October 2003),
  11. 11.
    Cox, L.P., Noble, B.D.: Samsara: Honor Among Thieves in Peer-to-Peer Storage. In: Proceedings of the 19th ACM Symposium on Operating System Principles (October 2003)Google Scholar
  12. 12.
    Gjerstad, S., Dickhaut, J.: Price formation in double auctions. Games and Economic Behavior 22(1)-C29 (1998)Google Scholar
  13. 13.
    Cliff, D., Bruten, J.: Minimal-intelligence agents for bargaining behaviors in marketbased environments, Technical Report HPL-97-91, Hewlett Packard Labs (1997)Google Scholar
  14. 14.
    Das, R., Hanson, J., Kephart, J., Tesauro, G.: Agent-Human Interactions in the Continuous Double Auction. In: Proceedings of the International Joint Conferences on Artificial Intelligence (IJCAI), Seattle, Washington, USA, August 4-10 (2001)Google Scholar
  15. 15.
    Wolski, R., Plank, J.S., Brevik, J., Bryan, T.: Analyzing Market-Based Resource Allocation Strategies for the Computational Grid. The International Journal of High Performance Computing Applications 15(3), 258–281 (2001)CrossRefGoogle Scholar
  16. 16.
    Livny, M., Raman, R., Solomon, M.: Matchmaking: Distributed Resource Management for High Throughput Computing. In: Proceedings of the Seventh IEEE International Symposium on High Performance Distributed Computing, Chicago, IL, July 28-31 (1998)Google Scholar
  17. 17.
    Hock, N.C.: Queuing Modelling Fundamentals. John Wiley & Sons Ltd., Chichester (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Ming Chen
    • 1
  • Guangwen Yang
    • 1
  • Xuezheng Liu
    • 1
  1. 1.Dept. of Computer Science and TechnologyTsinghua University 

Personalised recommendations