Skip to main content

Simulating Job Scheduling for Clusters of Workstations

  • Conference paper
  • First Online:

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

Abstract

In this paper we study hierarchical job scheduling strategies for clusters of workstations. Our approach uses two-level scheduling: global scheduling and local scheduling. The local scheduler refines the scheduling decisions made by the global scheduler, taking into account the most recent information. In this paper, we explore the First Come First Served (FCFS), the Shortest Job First (SJF), and the First Fit (FF) policies at the global level and the local level. In addition, we use separate queues at the global level for arriving jobs, where the jobs with the same number of tasks are placed in one queue. At both levels, the schedulers strive to maintain a good load balance. The unit of load balancing at the global level is the job consisting of one or more parallel tasks; at the local level it is the task.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. D. L. Clark, J. Casas, W. Otto, M Prouty, and J. Walpole. Scheduling of Parallel Jobs on Dynamic, Heterogeneous Networks. http://www.cse.ogi.edu/DISC/projects/cpe, 1995.

  2. C++SIM Simulation Package, Univ. of Newcastle Upon Tyne, http://cxxsim.ncl.ac.uk/, 1997.

  3. K. Czajkowski, I. Foster, N. Karonis, C. Kesselman. A Resource Management Architecture for Metacomputing Systems. In Proc. Job scheduling strategies for Parallel Processing, vol. 1459 of LNCS, pages 62–82, Springer-Verlag, 1998.

    Chapter  Google Scholar 

  4. D.G. Feitelson, and L. Rudolph. Metrics and benchmarking for parallel job scheduling. In Proc. Job Scheduling Strategies for Parallel Processing, vol. 1459 of LNCS, pages 1–24, Springer-Verlag, 1998.

    Chapter  Google Scholar 

  5. A. Hori, H. Tezuka, Y. Ishikawa, N. Soda, H. Konaka, and M. Maeda. Implementation of gang scheduling on workstation cluster. In Proc. Job Scheduling Strategies for Parallel Processing, vol. 1162 of LNCS, Springer-Verlag, 1996.

    Chapter  Google Scholar 

  6. M. Matsumoto and T. Nishimura. “Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator”. In ACM Transactions on Modeling and Computer Simulation, vol. 8 of ACM, January, 1998.

    Google Scholar 

  7. P. G. Sobalvarro, S. Pakin, W.E. Weihl, and A.A. Chien. Dynamic Coscheduling on Workstation Cluster. In Proc. Job Scheduling Strategies for Parallel Processing, vol. 1459 of LNCS, Springer-Verlag, 1998.

    Chapter  Google Scholar 

  8. G.D. van Albada, J. Clinckemaillie, A.H.L. Emmen, J. Gehring, O. Heinz, F. van der Linden, B.J. Overeinder, A. Reinefeld, and P.M.A. Sloot. Dynamite-blasting obstacles to parallel cluster computing. In High-Performance Computing and Networking (HPCN Europe’ 99), vol. 1593, Springer-Verlag, April 1999.

    Google Scholar 

  9. A.W. van Halderen, B.J. Overeinder, P.M.A. Sloot, R. van Dantzig, D.H.J. Epema, and M. Livny. Hierarchical Resource Management in the Polder Metacomputing Initiative. Parallel Computing, pages 1807–1825, November 1998.

    Google Scholar 

  10. K. Y.Wang, D. C. Marinescu, and O. F. Carbunar. Dynamic Scheduling of Process Groups. Concurrency: Practice and Experience, pages 265–283, April 1998.

    Google Scholar 

  11. J. B. Weissman, and A. S. Grimshaw. A Federated Model for Scheduling in Wide-Area Systems. In Proceedings of the Fifth IEEE International Symposium on High Performance Distributed Computing, pages 542–550, Syracuse, NY, Aug. 1996.

    Google Scholar 

  12. B.B Zhou, R.P. Brent, D. Walsh, and K. Suzaki. Job Scheduling Strategies for Networks of Workstations. In Proc. Job Scheduling Strategies for Parallel Processing, vol. 1459 of LNCS, pages 143–157, Springer-Verlag, 1998.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Santoso, J., van Albada, G.D., Nazief, B.A.A., Sloot, P.M.A. (2000). Simulating Job Scheduling for Clusters of Workstations. In: Bubak, M., Afsarmanesh, H., Hertzberger, B., Williams, R. (eds) High Performance Computing and Networking. HPCN-Europe 2000. Lecture Notes in Computer Science, vol 1823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45492-6_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-45492-6_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67553-2

  • Online ISBN: 978-3-540-45492-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics