Skip to main content

Task Allocation Using Processor Load Prediction on Multiprocessors Cluster

  • Conference paper
  • First Online:
Advanced Environments, Tools, and Applications for Cluster Computing (IWCC 2001)

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

Included in the following conference series:

  • 353 Accesses

Abstract

This paper describes a tool called Network-Analyser that increases the efficiency of clusters for parallel computing. Two important features are provided by this tool. First, it is organized in three hierarchical levels to collect information on workstations state. Secondly it provides several task allocation policies. In this paper a new policy that uses both instantaneous and average workstations loads to estimate tasks expected execution times, is developed. The multiprocessors workstation model used is based on round robin queuing system. A differential equation is established to describe transient state of the queuing system. Then an integral equation allows to estimate the expected execution time of regular parallel applications by mixing the deterministic processes of the parallel application with the stochastic load of the workstation.

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

Access this chapter

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. A. Barak, R. Wheeler. MOSIX: An Integrated Multiprocessors UNIX. Proceeding of 1989 winter USENIX conference, San Diego, pp. 101–112, January 1989.

    Google Scholar 

  2. D.R. Cheriton. The V Distributed system. Communication of the ACM, vol. 31 No 3, pp. 314–333, mars 1988.

    Article  Google Scholar 

  3. V.S. Sunderam, G.A. Geist, J. Dongarra, R. Manchek. The PVM concurrent computing system: Evolution, Experience, and Trends. Parallel Computing 20, pp. 531–545, 1994.

    Article  MATH  Google Scholar 

  4. T. Monteil, J.M. Garcia, D. Gauchard, O. Brun. Communication Kernel for High Speed Networks in the Parallel Environment LANDA-HSN. IWCC99: IEEE International Workshop on Cluster Computing, pp. 63–70, Melbourne Australia 1999.

    Google Scholar 

  5. William D. Gropp, Ewing Lusk User’s Guide for mpich, a Portable Implementation of MPI. Mathematics and Computer Science Division, Argonne National Laboratory, ANL-96/6, 1996

    Google Scholar 

  6. T. Monteil, J.M. Garcia Task Allocation Strategies on Workstations Using Processor Load Prediction. PDPTA97, International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 416–421, Las Vegas USA, 1997

    Google Scholar 

  7. J.M. Garcia, D. Gauchard, T. Monteil, O. Brun Process mapping given by processor and network dynamic load prediction Euro-Par99 5th International Euro-Par Conference pp. 291–294, Toulouse France, 1999

    Google Scholar 

  8. T.L. Casavant, J.G. Kuhl. A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems. IEEE Transactions on Software Engineering, vol. 14, No 2, February 1988.

    Google Scholar 

  9. Y.C. Chow, W.H. Kohler. Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System. IEEE Transactions on Computers, vol. c-28, No 5, pp. 354–361, 1979.

    Article  MathSciNet  Google Scholar 

  10. C.Y. Lee. Parallel machines scheduling with non simultaneous machine available time. Discrete Applied Mathematic North-Holland 30, pp 53–61, 1991.

    Article  MATH  Google Scholar 

  11. F. Bonomi, A. Kumar. Adaptive Optimal Load Balancing in a Non homogeneous Multi server System with a Central Job Scheduler. IEEE Transactions on Computers, Vol. 39, No 10, pp. 1232–1250, October 1990.

    Article  Google Scholar 

  12. L. Kleinrock Queuing systems volume II: Computer Applications. Wiley Inter-science

    Google Scholar 

  13. J. M. Garcia, F. Legall, J. Bernussou. A Model for Telephone Networks and its use for Routing Optimization Purposes. IEEE journal on selected areas in communication; Special issue on communication network performance evaluation; Vol 4 No 6 pp 966–974, September 1986.

    Google Scholar 

  14. R. L. Graham. Bounds on Multiprocessing Timing Anomalies. SIAM J. Appl. Math.; Vol 17 No 2, march 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monteil, T., Pascal, P. (2002). Task Allocation Using Processor Load Prediction on Multiprocessors Cluster. In: Grigoras, D., Nicolau, A., Toursel, B., Folliot, B. (eds) Advanced Environments, Tools, and Applications for Cluster Computing. IWCC 2001. Lecture Notes in Computer Science, vol 2326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47840-X_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-47840-X_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics