Reverse Auction-Based Grid Resources Allocation

  • Zhengyou Liang
  • Yu Sun
  • Ling Zhang
  • Shoubin Dong
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4088)


Resources allocation and tasks scheduling is key technology in grid computing system. The market-based resources allocation model is considered as a good one. In this paper, a resources allocation model, based on reverse auction, was proposed, and its mechanism and related pricing algorithms were designed. In this model, a resources consumer invites a public bidding on the basis of his deadline and budget, then a resources provider bids according to his load, and the bidder who bids the cheapest price will win the auction. Numerous simulating experiments based on our proposed model was conducted, the experiments showed that our model can satisfy a user’s QoS demand on deadline and budget, and have better performance in user utility, society utility, load-balance, job-completed rate than a commodity market-based resources allocation model.


Reserve Price User Agent Grid Resource Resource Provider Society Utility 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Buyya, R.: Economic-based Distributed Resource Management and Scheduling for Grid Computing, Ph.D. Thesis, Monash University, Melbourne, Australia (April 12, 2002)Google Scholar
  2. 2.
    Berman, F., Hey, A.J.G., Fox, G.: Grid Computing: Making The Global Infrastructure a Reality. John Wiley and Sons, Chichester (2003)Google Scholar
  3. 3.
    Buyya, R., Venugopal, S.: The Gridbus Toolkit for Service Oriented Grid and Utility Computing: An Overview and Status Report, CoRR, cs. DC/0404027 (2004)Google Scholar
  4. 4.
    Buyya, R., Abramson, D., Venugopal, S.: The Grid Economy. Proceedings of the IEEE 93(3) (March 2005)Google Scholar
  5. 5.
    Ranjan, R., Harwood, A., Buyya, R.: Grid Federation: An Economy Based Distributed Resource Management System for large-scale Resource Coupling. Technical Report, GRIDS-TR-2004-10, Grid Computing and Distributed Systems Laboratory, University of Melbourne, Australia (December 7, 2004)Google Scholar
  6. 6.
    Venugopal, S., Buyya, R.: An Economy-based Algorithm for Scheduling Data-Intensive Applications on Global Grids, Technical Report, GRIDS-TR-2004-11, Grid Computing and Distributed Systems Laboratory, University of Melbourne, Australia (December 8, 2004)Google Scholar
  7. 7.
    Yeo, C.S., Buyya, R.: A taxonomy of market-based resource management systems for utility-driven cluster computing, Software: Practice and Experience. Wiley Press, USA (2005)Google Scholar
  8. 8.
    de Assuncao, M.D., Buyya, R.: An Evaluation of Communication Demand of Auction Protocols in Grid Environments. In: Proceedings of the 3rd International Workshop on Grid Economics & Business (GECON 2006), May 16, 2006, Singapore (2006)Google Scholar
  9. 9.
    Cheliotis, G., Kenyon, C., Buyya, R.: Grid Economics: 10 Lessons from Finance. In: Subramanian, R., Goodman, B. (eds.) Peer-to-Peer Computing: Evolution of a Disruptive Technology, Idea Group Publisher, Hershey, PAGoogle Scholar
  10. 10.
    Buyya, R., Murshed, M., Abramson, D., Venugopal, S.: Scheduling Parameter Sweep Applications on Global Grids: A Deadline and Budget Constrained Cost-Time Optimisation Algorithm, CoRR cs. DC/0203020 (2002)Google Scholar
  11. 11.
    Liang, Z., Zhang, L., Dong, S., Wei, W.: Charging and Accounting for Grid Computing System. In: Li, M., Sun, X.-H., Deng, Q.-n., Ni, J. (eds.) GCC 2003. LNCS, vol. 3033, Springer, Heidelberg (2004)Google Scholar
  12. 12.
    Chen, C., Maheswaran, M., Toulouse, M.: Supporting co-allocation in an auctioning-based resource allocator for grid systems. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2002), vol. 306 (2002)Google Scholar
  13. 13.
    Buyya, R., Murshed, M.: GridSim: A toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing. J. Concurrency and Computation: Practic-Experience (CCPE) 14, 1175–1220 (2002)MATHCrossRefGoogle Scholar
  14. 14.
    Kurose, J., Simha, R.: A microeconomic approach to optimal resource allocation in distributed computer systems. IEEE Trans. on Computers 38(5), 705–717 (1989)CrossRefGoogle Scholar
  15. 15.
    Waldspurger, C.A., Hogg, T., Huberman, B., Kephart, J., Stornetta, S.: Spawn: A distributed computational ecology. IEEE Trans. on Software Engg. 18(2) (February 1992)Google Scholar
  16. 16.
    Kuwabara, K., Ishida, T., Nishibe, Y., Suda, T.: An Equilibratory Market-Based Approach for Distributed Resource Allocation and Its Applications to Communication Network Control. In: Clearwater, S.H. (ed.) Market-Based Control: A Paradigm for Distributed Resource Allocation, World Scientific Publishing, Singapore (1996)Google Scholar
  17. 17.
    Gibney, M.A., Jennings, N.R.: Dynamic resource allocation by market-based routing in telecommunications networks. In: 2nd Int. Workshop on Multi-Agent Systems and Telecommunications, pp. 102–117 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Zhengyou Liang
    • 1
  • Yu Sun
    • 1
  • Ling Zhang
    • 2
  • Shoubin Dong
    • 2
  1. 1.School of Computer and Electronic InformationGuangXi UniversityNanNingP.R. China
  2. 2.GuangDong Key Laboratory of Computer Network, South ChinaUniversity of TechnologyGuangZhouP.R. China

Personalised recommendations