[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Load Balancing for Minimizing Execution Time of a Target Job on a Network of Heterogeneous Workstations

  • Conference paper
Job Scheduling Strategies for Parallel Processing (JSSPP 2000)

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

Included in the following conference series:

Abstract

A network of workstations (NOWs) may be employed for high performance computing where execution time of a target job is to be minimized. Job arrival rate and size are “random≓ on a NOWs. In such an environment, partitioning (load balancing) a target job based on only the .rst order moments (means) of system parameters is not optimal. In this paper, it is proposed to consider the second order moments (standard deviations) also in load balancing in order to minimize execution time of a target job on a set of workstations where the round-robin job scheduling policy is adopted. It has been veri.ed through computer simulation that the proposed static and dynamic load balancing schemes can signi.cantly reduce execution time of a target job in a NOWs environment, compared to cases where only the means of the parameters are used.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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.

Similar content being viewed by others

References

  1. D. Culler, “Parallel Computer Architecture≓, Morgan Kaufman, 1999.

    Google Scholar 

  2. G. Cybenko, “Dynamic Load Balancing for Distributed Memory Multiprocessors≓, J. Parallel and Distributed Computing, vol. 7, pp279–301, 1989.

    Article  Google Scholar 

  3. C. Polychronopoulos and D. Kuck, “Guided Self-Scheduling Scheme for Parallel Supercomputers≓, IEEE Transactions on Computers, vol. 36, no.12, pp1,425–1,439, December 1987.

    Article  Google Scholar 

  4. S. Ranka, Y. Won, and S. Sahni, “Programming a Hypercube Multicomputer≓, IEEE Software, pp69–77, September 1988.

    Google Scholar 

  5. M. Maheswaran and H. Siegel, “A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems≓, Proc. Heterogeneous Computing ’98, pp57–69, 1998.

    Google Scholar 

  6. M. Cierniak, W. Li, and M.J. Zaki, “Loop Scheduling for Heterogeneity≓, Proc. of the 4th IEEE International Symposium High-Performance Distributed Computing, pp78–85, August 1995.

    Google Scholar 

  7. A. Gerasoulis and T. Yang, “On the Granularity and Clustering of Directed Acyclic task graphs≓, IEEE Transactions on Parallel and Distributed Systems, vol. 4, no.6, pp686–701, 1993.

    Article  Google Scholar 

  8. S. M. Figueira and F. Berman, “Modeling the Slowdown of Data-Parallel Applications in Homogeneous Clusters of Workstations≓, Proc. Heterogeneous Computer Workshop, pp90–101, 1998.

    Google Scholar 

  9. J.C. Jacob and S.-Y. Lee, “Task Spreading and Shrinking on Multiprocessor Systems and Networks of Workstations≓, IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 10, pp1082–1101, October 1999.

    Article  Google Scholar 

  10. E.P. Makatos and T.J. Leblanc, “Using Processor A.nity in Loop Scheduling on Shared-Memory Multiprocessors≓, IEEE Transactions on Parallel and Distributed Systems, vol. 5, no.4, pp379–400, April 1993.

    Article  Google Scholar 

  11. S. Subramaniam and D.L. Eager, “A.nity Scheduling of Unbalanced Workloads≓, Proc. Supercomputing ’94, pp214–226, 1994.

    Google Scholar 

  12. M.-Y. Wu, “On Runtime Parallel Scheduling for Processor Load Balancing≓, IEEE Transactions on Parallel and Distributed Systems, vol. 8, no.2, pp173–186, February 1997.

    Article  Google Scholar 

  13. X. Zhang and Y. Yan, “Modeling and Characterizing Parallel Computing Performance On Heterogeneous Networks of Workstations≓, Proc. of the 7th IEEE Symp. Parallel and Distributed Processing, pp25–34, October 1995.

    Google Scholar 

  14. B.-R. Tsai and K. G. Shin, “Communication-Oriented Assignment of Task Modules in Hypercube Multicomputers≓, Proc. of the 12th International Conference on Distributed Computing Systems, pp 38–45, 1992.

    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

Lee, SY., Cho, CH. (2000). Load Balancing for Minimizing Execution Time of a Target Job on a Network of Heterogeneous Workstations. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2000. Lecture Notes in Computer Science, vol 1911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39997-6_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-39997-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41120-8

  • Online ISBN: 978-3-540-39997-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics