Skip to main content

A Dynamic Pricing Algorithm for Super Scheduling of Computational Grid

  • Conference paper
  • First Online:
Innovations and Advances in Computing, Informatics, Systems Sciences, Networking and Engineering

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 313))

  • 1933 Accesses

Abstract

In this paper, we propose a dynamic pricing strategy which is based peer-to-peer grid computing used for a SLA_based super scheduling and greedy backfilling resource allocation mechanism. Our goal is making load balancing in the overall grid system, by changing the value of resources. Without any pricing policy in grid, because of increasing load of cheaper resources and lack of demands for expensive resources, system will be out of balance.

In this paper, our attention is towards the load factor in the overall system and the load factor on each resource. The rates of demand and supply for each resource are two other criteria for overall system price balancing in system. If the price of a resource is high its demand becomes low hence a price adjusting algorithm must be active to insure acceptable utilization of resources. On the other hand is the price of a resource is low it will receive many demands which in turn will increase the turnaround time of the requests. These algorithms are developed in this research and the overall effectiveness of the algorithm is evaluated. In result, we almost receive balancing state at overall system.

The key advantages of our approach are (1) increase in the total earning of resource owners and users, (2) increase in the number of resources being used, (3) increase in the number of accepted jobs, and (4) decrease in the rate of budget spent of users.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ranjan, R. Harwood, A. Buyya, R. 2006. SLA-Based Cooperative Superscheduling Algorithms for Computational Grids. ACM Journal Name, Vol. V, No. N, Pages 1–27.

    Google Scholar 

  2. Buyya, R. 2002. Economic-based Distributed Resource Management and Scheduling for Grid Computing. A thesis submitted in fulfillment of the requirements for the Degree of Doctor of Philosophy. Page 1.

    Google Scholar 

  3. Ouelhadj, D., Garibaldi, J., MacLaren, J., Sakellariou, R., and Krishna Kumar, K. 2005. A multi-agent infrastructure and a service level agreement negotiation protocol for robust scheduling in grid computing. In Proceedings of the European Grid Conference. Lecture Notes in Computer Science, Springer-Verlag.

    Google Scholar 

  4. Lai, K., Huberman, B. A., and Fine, L. 2004. Tycoon: A distributed market-based resource allocation system. Technical Report, HP Labs.

    Google Scholar 

  5. Subramani, V., Kettimuthu, R., Srinivasan, S., and Sadayappan, P. 2002. Distributed job scheduling on computational grids using multiple simultaneous requests. In 11th IEEE International Symposium on High Performance Distributed Computing (HPDC-11), 23–26 July.IEEE Computer Society, Washington, DC, USA.

    Google Scholar 

  6. Butt, A. R., Zhang, R., and Hu, Y. C. 2003. A self-organizing flock of condors. In SC ‘03: Proceedings of the 2003 ACM/IEEE conference on Supercomputing. IEEE Computer Society, Washington, DC, USA.

    Google Scholar 

  7. Shan, H., Oliker, L., and Biswas, R. 2003. Job super scheduler architecture and performance in computational grid environments. In SC ‘03: Proceedings of the 2003 ACM/IEEE conference on Supercomputing. IEEE Computer Society, Washington, DC, USA, 44.

    Google Scholar 

  8. Yeo, C. and Buyya, R. Service level agreement based allocation of cluster resources: Handling penalty to enhance utility. In Proceedings of the 7th IEEE International Conference on Cluster Computing (CLUSTER’05), Boston, MA

    Google Scholar 

  9. Abramson, D., Buyya, R., and Giddy, J. 2002. A computational economy for grid computing and its implementation in the Nimrod-G resource broker. Future Generation Computer Systems (FGCS) Journal, Volume 18, Issue 8, Pages: 1061–1074, Elsevier Science, The Netherlands, October.

    Google Scholar 

  10. Cai, M., Frank, M., Chen, J., and Szekely, P. 2003. Maan: A Multi-atribute addressable network for grid information services. Proceedings of the Fourth IEEE/ACM International workshop on Grid Computing; Page(s):184–191.

    Google Scholar 

  11. M. Stonebraker, R. Devine, M. Kornacker, W. Litwin, A. Pfeffer, A. Sah, C. Staelin, An Economic Paradigm for Query Processing and Data Migration in Mariposa, Proceedings of 3rd International Conference on Parallel and Distributed Information Systems, Austin, TX, USA, 28–30 Sept. 1994. Los Alamitos, CA, USA: IEEE Comput. Soc. Press, 1994.

    Google Scholar 

  12. Heiser G, Lam F, and Russell SM, Resource Management in the Mungi Single-Address-Space Operating System, Proceedings of Australasian Computer Science Conference, Perth Australia, Feb. 1998, Springer-Verlag, Singapore, 1998.

    Google Scholar 

  13. Noam Nisan, Shmulik London, Ori Regev, Noam Camiel, Globally Distributed computation over the Internet - the POPCORN project, International Conference on Distributed Computing Systems (ICDCS’98) 1998. Also a poster in WWW6 – Sixth International World Wide Web Conference, Santa-Clara in April 1997. (http://www.cs.huji.ac.il/~popcorn/)

  14. Yair Amir, Baruch Awerbuch and R. Sean Borgstrom, A Cost-Benefit Framework for Online Management of a Metacomputing System, Proceedings of first International Conference on Information and Computational Economy, Charleston, Oct. 1998.

    Google Scholar 

  15. Amir Y., Awerbuch B., Barak A., Borgstrom R.S. and Keren A., An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster, IEEE Tran. Parallel and Distributed Systems, Vol. 11, No. 7, July 2000.

    Google Scholar 

  16. Dickon Reed, Ian Pratt, Paul Menage, Stephen Early, Neil Stratford, Xenoservers; Accounted execution of untrusted code, Hot topics in Operating Systems, 1999. http://www.cl.cam.ac.uk/Research/SRG/netos/xeno/

  17. Jonathan Bredin and David Kotz and Daniela Rus, Utility Driven Mobile-Agent Scheduling, Technical Report PCSTR98- 331, Dept. of Computer Science, Dartmouth College, October 3, 1998.

    Google Scholar 

  18. C. Waldspurger, T. Hogg, B. Huberman, J. Kephart, and W. Stornetta, Spawn: A Distributed Computational Economy, IEEE Transactions on Software Engineering, Vol. 18, No. 2, Feb. 1992.

    Google Scholar 

  19. Spyros Lalis and Alexandros Karipidis, An Open Market-Based Framework for Distributed Computing over the Internet, First IEEE/ACM International Workshop on Grid Computing (GRID 2000), Dec. 2000, Bangalore, India: Springer Verlag, Germany.

    Google Scholar 

  20. Brent Chun and David Culler, Market-based proportional resource sharing for clusters, Technical report, University of California, Berkeley, September 1999.

    Google Scholar 

  21. Mojo Nation - http://www.mojonation.net/, Nov. 2000.

  22. Schopf, J. 2001. Ten actions when super scheduling. In Global Grid Forum.

    Google Scholar 

  23. Wolski, R., Plank, J. S., Brevik, J., and Bryan, T. 2001. G-commerce: Market formulations controlling resource allocation on the computational grid. In IPDPS ‘01: Proceedings of the 15th International Parallel & Distributed Processing Symposium. IEEE Computer Society, Washington, DC, USA, 46.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Reihaneh Bazoubandi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Bazoubandi, R., Abdoli, F. (2015). A Dynamic Pricing Algorithm for Super Scheduling of Computational Grid. In: Sobh, T., Elleithy, K. (eds) Innovations and Advances in Computing, Informatics, Systems Sciences, Networking and Engineering. Lecture Notes in Electrical Engineering, vol 313. Springer, Cham. https://doi.org/10.1007/978-3-319-06773-5_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-06773-5_60

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-06772-8

  • Online ISBN: 978-3-319-06773-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics