Skip to main content
SpringerLink
Log in

Economic Scheduling in Grid Computing

  • Conference paper
  • First Online:
Job Scheduling Strategies for Parallel Processing (JSSPP 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2537))

Included in the following conference series:

Abstract

Grid computing is a promising technology for future computing platforms. Here, the task of scheduling computing resources proves difficult as resources are geographically distributed and owned by individuals with different access and cost policies. This paper addresses the idea of applying economic models to the scheduling task. To this end a scheduling infrastructure and a market-economic method is presented. The efficiency of this approach in terms of response- and waittime minimization as well as utilization is evaluated by simulations with real workload traces. The evaluations show that the presented economic scheduling algorithm provides similar or even better average weighted response-times as common algorithms like backfilling. This is especially promising as the presented economic models have additional advantages as e.g. support for different price models, optimization objectives, access policies or quality of service demands.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Bogan. Economic allocation of computation time with computation markets. In Master Thesis. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, May 1994. 131

    Google Scholar 

  2. R. Buyya, D. Abramson, J. Giddy, and H. Stockinger. Economic Models for Resource Management and Scheduling in Grid Computing. Special Issue on rid Computing Environments, The Journal of Concurrency and Computation: ractice and Experience (CCPE), May 2002(accepted for publication). 130, 131

    Google Scholar 

  3. R. Buyya, J. Giddy, and D. Abramson. An Evaluation of Economy-based Resource rading and Scheduling on Computational Power Grids for Parameter weep Applications. In The Second Workshop on Active Middleware Services AMS 2000), In conjuction with Ninth IEEE International Symposium on High Performance Distributed Computing (HPDC 2000), Pittsburgh, USA, August 2000. Kluwer Academic Press. 134

    Google Scholar 

  4. K. Czajkowski, I. Foster, C. Kesselman, S. Martin, W. Smith, and S. Tuecke. A Resource Management Architecture for Metacomputing Systems. In Job Scheduling Strategies for Prallel Processing, volume 1459 of Lecutre Notes in Computer Science, pages 62–68. Springer Verlag, 1998. 130

    Google Scholar 

  5. C. Ernemann, V. Hamscher, U. Schwiegelshohn, A. Streit, and R. Yahyapour. On Advantages of Grid Computing for Parallel Job Scheduling. In Proceedings of the 2nd IEEE International Symposium on Cluster Computing and the Grid (CC-GRID 2002), Berlin, pages 39–46, 2002. 129, 142

    Google Scholar 

  6. C. Ernemann, V. Hamscher, A. Streit, and R. Yahyapour. On Effects of Machine Configurations on Parallel Job Scheduling in Computational Grids. In International Conference on Architecture of Computing Systems, (ARCS 2002), pages 169–179. VDE-Verlag, April 2002. 142

    Google Scholar 

  7. D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, K. C. Sevcik, and P. Wong. Theory and Practice in Parallel Job Scheduling. In D. G. Feitelson and L. Rudolph, editors, IPPS’97 Workshop: Job Scheduling Strategies for Parallel Processing, pages 1–34. Springer-Verlag, Lecture Notes in Computer Science LNCS 1291, 1997. 129

    Google Scholar 

  8. D. G. Feitelson and A. M. Weil. Utilization and Predictability in Scheduling the IBM SP2 with Backfilling. In Procedings of IPPS/SPDP 1998, pages 542–546. IEEE Computer Society, 1998. 143

    Google Scholar 

  9. I. Foster and C. Kesselman. Globus: A metacomputing Infrastructure Toolkit. The International Journal of Supercomputer Applications and High Performance Computing, 11(2):115–128, 1997. 129

    Article  Google Scholar 

  10. I. Foster and C. Kesselman, editors. The GRID: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, 1998. 128

    Google Scholar 

  11. V. Hamscher, U. Schwiegelshohn, A. Streit, and R. Yahyapour. Evaluation of Job-Scheduling Strategies for Grid Computing. Lecture Notes in Computer Science, 1971:191–202, 2000. 129, 141, 142

    Google Scholar 

  12. S. Hotovy. Workload Evolution on the Cornell Theory Center IBM SP2. In D. G. Feitelson and L. Rudolph, editors, IPPS’96 Workshop: Job Scheduling Strategies for Parallel Processing, pages 27–40. Springer-Verlag, Lecture Notes in Computer Science LNCS 1162, 1996. 141

    Google Scholar 

  13. J. Krallmann, U. Schwiegelshohn, and R. Yahyapour. On the Design and Evaluationof Job Scheduling Systems. In D. G. Feitelson and L. Rudolph, editors, IPPS/SPDP’99 Workshop: Job Scheduling Strategies for Parallel Processing. Springer-Verlag, Lecture Notes in Computer Science, 1999. 141

    Google Scholar 

  14. D. A. Lifka. The ANL/IBM SP Scheduling System. In D. G. Feitelson and L. Rudolph, editors, IPPS’95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 295–303. Springer-Verlag, Lecture Notes in Computer Science LNCS 949, 1995. 129, 142

    Google Scholar 

  15. M. Livny and R. Raman. High-Throughput Resource Management. In I. Foster and C. Kesselman, editors, The Grid-Blueprint for a New Computing Infrastructure, pages 311–337. Morgan Kaufmann, 1999. 128

    Google Scholar 

  16. U. Schwiegelshohn and R. Yahyapour. Analysis of First-Come-First-Serve Parallel Job Scheduling. In Proceedings of the 9th SIAM Symposium on Discrete Algorithms, pages 629–638, January 1998. 142

    Google Scholar 

  17. U. Schwiegelshohn and R. Yahyapour. Resource Allocation and Scheduling in Metasystems. In P. Sloot, M. Bibak, A. Hoekstra, and B. Hertzberger, editors, Proceedings of the Distributed Computing and Metacomputing Workshop at HPCN Europe, pages 851–860. Springer-Verlag, Lecture Notes in Computer Science LNCS 1593, April 1999. 132

    Google Scholar 

  18. L. Smarr and C. E. Catlett. Metacomputing. Communications of the ACM, 35(6):44–52, June 1992. 128

    Article  Google Scholar 

  19. I. Stoica, H. Abdel-Wahab, and A. Pothen. A Microeconomic Scheduler for Parallel Computers. In D. G. Feitelson and L. Rudolph, editors, IPPS’95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 200–218. Springer-Verlag, Lecture Notes in Computer Science LNCS 949, 1995. 130

    Google Scholar 

  20. M. Stonebraker, P. M. Aoki, W. Litwin, A. Pfeffer, A. Sah, J. Sidell, C. Staelin, and A. Yu. Mariposa: A Wide-Area Distributed Database System. VLDB Journal, 5(1):48–63, 1996. 130

    Article  Google Scholar 

  21. K. R. Grant T. W. Malone, R. E. Fikes and M. T. Howard. Enterprise: A Marketlike Task Scheduler for Distributed Computing Environments. In The Ecology of Computation, volume 2 of Studies in Computer Science and Artifical Intelligence, pages 177–255, 1988. 131

    Google Scholar 

  22. P. Tucker. Market Mechanisms in a Programmed System. Department of Computer Science and Engineering, University of California, 1998. 130

    Google Scholar 

  23. P. Tucker and F. Berman. On market mechanisms as a software technique, 1996. 130, 131

    Google Scholar 

  24. C. A. Waldspurger, T. Hogg, B. Huberman, J. O. Kephart, and W. S. Stornetta. Spawn: A distributed computational economy. IEEE Transactions on Software Engineering, 18(2):103–117, 1992. 130

    Article  Google Scholar 

  25. W. Walsh, M. Wellman, P. Wurman, and J. MacKieMason. Some economics of market-based distributed scheduling. In In Eighteenth International Conference on Distributed Computing Systems, pages 612–621, 1998. 131

    Google Scholar 

  26. F. Ygge. Market-Oriented Programming and its Application to Power Load Management. PhD thesis, Department of Computer Science, Lund University, 1998. 131

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Institute, University of Dortmund, 44221, Dortmund, Germany

    Carsten Ernemann, Volker Hamscher & Ramin Yahyapour

Authors
  1. Carsten Ernemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Volker Hamscher
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ramin Yahyapour
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Engineering, The Hebrew University, 91904, Jerusalem, Israel

    Dror G. Feitelson

  2. Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA

    Larry Rudolph

  3. Computer Engineering Institute, Universität Dortmund, 44221, Dortmund, Germany

    Uwe Schwiegelshohn

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ernemann, C., Hamscher, V., Yahyapour, R. (2002). Economic Scheduling in Grid Computing. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2002. Lecture Notes in Computer Science, vol 2537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36180-4_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-36180-4_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00172-0

  • Online ISBN: 978-3-540-36180-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation