Skip to main content

Global Backfilling Scheduling in Multiclusters

  • Conference paper

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

Abstract

There exist a centralized scheduler structure and a distributed scheduler structure at multiclusters scheduler. The current centralized scheduler structure requires exact knowledge of scheduling activities about geographically distributed clusters. However, such timely and frequent information dissertation can not be supported by existed network infrastructure. In order to make the centralized scheduler structure realistic, this paper investigates the global scheduler at muliclusters without timely and frequently information distribution. This global scheduler is based on the backfilling scheduling policy and the global scheduler tries to find holes at clusters for queued jobs at other cluster. This global backfilling scheduling policy is evaluated by using real workload trace driven simulation. The simulation results show that proposed policy consistently outperforms the independent site execution.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bucur, A., Epema, D.: Local versus Global Queues with Processor Co-Allocation in Multicluster Systems. In: Feitelson, D., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol. 2537, pp. 184–204. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Bucur, A., Epema, D.: The Performance of Processor Co-Allocation in Multicluster Systems. In: Proceedings of the CC-GRID 2003 (2003)

    Google Scholar 

  3. Lifka, D.: The ANL/IBM SP scheduling system. In: JSSPP (1995)

    Google Scholar 

  4. Skovira, J., Chan, W., Zhou, H., Lifka, D.: The easy-loadleveler API project. In: JSSPP (1996)

    Google Scholar 

  5. Arndt, O., Freisleben, B., Kielmann, T., Thilo, F.: A comparative study of online scheduling algorithms for networks of workstations. Cluster Computing 3(2), 95–112 (2000)

    Article  Google Scholar 

  6. Hamscher, V., Schwiegelshohn, U., Streit, A., Yahyapour, R.: Evaluation of Job-Scheduling Strategies for Grid Computing. In: Proc. Grid 2000, pp. 191–202 (2000)

    Google Scholar 

  7. Feitelson, D.G.: Parallel Workload Archive, http://www.cs.huji.ac.il/labs/parallel/workload/logs.html

  8. Srinivasan, S., Kettinuthu, R., Subramani, V., Sadayappan, P.: Characterization of Backfilling Strategies for Parallel Job Scheduling. In: Proceedings of 2002 Intl. Workshops on Parallel Processing (2002)

    Google Scholar 

  9. Ernemann, C., Hamscher, V., Streit, A., Yahhyapour, R.: On Effects of Machine Configurations on Parallel Job Scheduling in Computational Grids. In: Proceedings of International Conference on Architecture of Computing Systems (ARCS 2002), pp. 169–176 (2002)

    Google Scholar 

  10. Ernemann, C., Hamscher, V., Schwiegelshohn, U., Yahyapour, R., Streit, A.: On Advantages of Grid Computing for Parallel Job Scheduling. In: Proceedings of the CC-GRID 2002, pp. 39–46 (2002)

    Google Scholar 

  11. Subramani, V., Kettimuthu, R., Srinivasan, S., Sadayappan, P.: Distributed Job Scheduling on Computational Grids using Multiple Simultaneous Requests. In: Proc. of 11-th IEEE Symposium on High Performance Distributed Computing, HPDC 2002 (2002)

    Google Scholar 

  12. Subramani, V., Kettimuthu, R., Srinivasan, S., Sadayappan, P.: Scheduling of Parallel Jobs in a Heterogeneous Multi-Site Environment. In: Proceeding of 9th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP 2003) pp. 87–104 (2003)

    Google Scholar 

  13. Ranganathan, K., Foster, I.: Simulation Studies of Computation and Data Scheduling Algorithms for Data Grids. Journal of Grid Computing 1, 53–62 (2003)

    Article  Google Scholar 

  14. Lawson, B.G., Smirni, E., Puiu, D.: Self-adpating backfilling scheduling for parallel Systems. In: International Conference on Parallel Processing (2002)

    Google Scholar 

  15. Mu’alem, W., “Feitelson, D.G.: Utilization, predictability,workloads, and user runtime estimates in scheduling the IBM sp2 with backfilling. In: IEEE Transactions on Parallel and Distributed Computing 12 (2001)

    Google Scholar 

  16. Wolski, R., Spring, N., Hayes, J.: The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing. Journal of Future Generation Computing Systems, 757–768 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yue, J. (2004). Global Backfilling Scheduling in Multiclusters. In: Manandhar, S., Austin, J., Desai, U., Oyanagi, Y., Talukder, A.K. (eds) Applied Computing. AACC 2004. Lecture Notes in Computer Science, vol 3285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30176-9_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30176-9_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23659-7

  • Online ISBN: 978-3-540-30176-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics