Skip to main content
SpringerLink
Log in

Job scheduling strategies for networks of workstations

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

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

Included in the following conference series:

Abstract

In this paper we first introduce the concepts of utilisation ratio and effective speedup and their relations to the system performance. We then describe a two-level scheduling scheme which can be used to achieve good performance for parallel jobs and good response for interactive sequential jobs and also to balance both parallel and sequential workloads. The two-level scheduling can be implemented by introducing on each processor a registration office. We also introduce a loose gang scheduling scheme. This scheme is scalable and has many advantages over existing explicit and implicit coscheduling schemes for scheduling parallel jobs under a time sharing environment.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Agerwala, J. L. Martin, J. H. Mirza, D. C. Sadler, D. M. Dias and M. Snir, SP2 system architecture, IBM Systems Journal, 34(2), 1995.

    Google Scholar 

  2. S. V. Anastasiadis and K. C. Sevcik, Parallel application scheduling on networks of workstations, Journal of Parallel and Distributed Computing, 43, 1997, pp.109–124.

    Article  Google Scholar 

  3. T. E. Anderson, D. E. Culler, D. A. Patterson and the NOW team, A case for NOW (networks of workstations), IEEE Micro, 15(1), Feb. 1995, pp.54–64.

    Article  Google Scholar 

  4. R. H. Arpaci, A. C. Dusseau, A. M. Vahdat, L. T. Liu, T. E. Anderson and D. A. Patterson, The interaction of parallel and sequential workloads on a network of workstations, Proceedings of ACM SIGMETRICS'95/PERFORMANCE'95 Joint International Conference on Measurement and Modeling of Computer Systems, May 1995, pp.267–278.

    Google Scholar 

  5. A. C. Arpaci-Dusseau and D. E. Culler, Extending proportional-share scheduling to a network of workstations, Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, Nevada, June 1997.

    Google Scholar 

  6. M. Crovella, P. Das, C. Dubnicki, T. LeBlanc and E. Markatos, Multiprogramming on multiprocessors, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, Dec. 1991, pp.590–597.

    Google Scholar 

  7. J. J. Dongarra, Performance of various computers using standard linear equations software, Technical Report CS-89-95, Computer Science Department, University of Tennessee, Nov. 1997.

    Google Scholar 

  8. A. C. Dusseau, R. H. Arpaci and D. E. Culler, Effective distributed scheduling of parallel workloads, Proceedings of ACM SIGMETRICS'96 International Conference, 1996.

    Google Scholar 

  9. D. G. Feitelson and L. Rudolph, Gang scheduling performance benefits for fine-grained synchronisation, Journal of Parallel and Distributed Computing, 16(4), Dec. 1992, pp.306–318.

    Article  MATH  Google Scholar 

  10. D. Ghosal, G. Serazzi and S. K. Tripathi, The processor working set and its use in scheduling multiprocessor systems, IEEE Transactions on Software Engineering, 17(5), May 1991, pp.443–453.

    Article  Google Scholar 

  11. A. Gupta, A. Tucker and S. Urushibara, The impact of operating system scheduling policies and synchronisation methods on the performance of parallel applications. Proceedings of the 1991 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, May 1991, pp.120–131.

    Google Scholar 

  12. K. Li, IVY: A shared virtual memory system for parallel computing, Proceedings of International Conference on Parallel Processing, 1988, pp.94–101.

    Google Scholar 

  13. S.-P. Lo and V. D. Gligor, A comparative analysis of multiprocessor scheduling algorithms, Proceedings of the 7th International Conference on Distributed Computing Systems, Sept. 1987, pp.205–222.

    Google Scholar 

  14. V. K. Naik, S. K. Setia and M. S. Squillante, Performance analysis of job scheduling policies in parallel supercomputing environments, Proceedings of Supercomputing'93, Nov. 1993, pp.824–833.

    Google Scholar 

  15. V. K. Naik, S. K. Setia and M. S. Squillante, Processor allocation in multiprogrammed distributed-memory parallel computer systems, IBM Research Report RC 20239, 1995.

    Google Scholar 

  16. J. K. Ousterhout, Scheduling techniques for concurrent systems, Proceedings of Third International Conference on Distributed Computing Systems, May 1982, pp.20–30.

    Google Scholar 

  17. E. Rosti, E. Smirni, L. Dowdy, G. Serazzi and B. M. Carlson, Robust partitioning policies of multiprocessor systems, Performance Evaluation, 19(2–3), 1994, pp.141–165.

    Article  Google Scholar 

  18. S. K. Setia, M. S. Squillante and S. K. Tripathi, Analysis of processor allocation in multiprogrammed, distributed-memory parallel processing systems, IEEE Transactions on Parallel and Distributed Systems, 5(4), April 1994, pp.401–420.

    Article  Google Scholar 

  19. I. Stoica, H. Abdel-wahab, K, Jeffay, S. Baruah, J. Gehrke and C. G. Plaxton, A Proportional share resource allocation algorithm for real-time, time-shared systems, IEEE Real-Time Systems Symposium, Dec. 1996.

    Google Scholar 

  20. K. Suzaki, H. Tanuma, S. and Y. Ichisugi, Design of combination of time sharing and space sharing for parallel task scheduling, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, Nevada, Nov. 1997.

    Google Scholar 

  21. C. A. Waldspurger and W. E. Weihl, Stride scheduling: deterministic proportional-share resource management, Technical Report MIT/LCS/TM-528, MIT Laboratory for Computer Science, MIT, June 1995.

    Google Scholar 

  22. J. Zahorjan and E. D. Lazowska, Spinning versus blocking in parallel systems with uncertainty, Proceedings of the IFIP International Seminar on Performance of Distributed and Parallel Systems, Dec. 1988, pp.455–472.

    Google Scholar 

  23. B. B. Zhou, X. Qu and R. P. Brent, Effective scheduling in a mixed parallel and sequential computing environment, Proceedings of the 6th Euromicro Workshop on Parallel and Distributed Processing, Madrid, Jan 1998.

    Google Scholar 

  24. B. B. Zhou, R. P. Brent, D. Walsh and K. Suzaki, A multi-class time/space sharing system, Tech. Rep., DCS and CSLab, Australian National University, 1998, in process.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Sciences Laboratory, Australian National University, 0200, Canberra, ACT, Australia

    B. B. Zhou & R. P. Brent

  2. CAP Research Program, Australian National University, 0200, Canberra, ACT, Australia

    D. Walsh

  3. Electrotechnical Laboratory, 1-1-4 Umezono, sukuba, 305, Ibaraki, Japan

    K. Suzaki

Authors
  1. B. B. Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. P. Brent
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Walsh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. K. Suzaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dror G. Feitelson Larry Rudolph

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, B.B., Brent, R.P., Walsh, D., Suzaki, K. (1998). Job scheduling strategies for networks of workstations. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1998. Lecture Notes in Computer Science, vol 1459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053985

Download citation

  • DOI: https://doi.org/10.1007/BFb0053985

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64825-3

  • Online ISBN: 978-3-540-68536-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation