Skip to main content

Abstract

The effectiveness of task scheduling in a distributed environment is critically dependent on the timely identification of the least loaded nodes. Whether the issue of interest is load-sharing or distributed parallel computation, overall system performance is determined in large part by the characteristics of the nodes participating in a particular computation. The diversity of node characteristics across the network frequently results in a spectrum of available compute powers on different nodes. Due to the high cost of task migration, effective evaluation of the relative available compute powers of the nodes in the network and the use of that information in task distribution are essential components of successful task scheduling in a distributed environment.

This material is based on work supported in part by the National Science Foundation under Grant No. CRR-93–19776.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. G. E. P. Box, G. M. Jenkins, “Time Series Analysis: Forecasting and Control”, Holden-Day, 1976.

    Google Scholar 

  2. A. Diaz, M. Hitz, E. Kaltofen, A. Lobo, T. Valente, “Process Scheduling in DSC and the Large Sparce Linear Systems Challenge”, Proc. DISCO ‘83, Springer Lect. Notes Comput. Sci., A. Miola (ed.), Vol. 722, pp. 66–80, 1993. J. Symbolic Computation, to appear.

    Google Scholar 

  3. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, V. Sunderam, “PVM Parallel Virtual Machine A Users’ Guide and Tutorial for Network Parallel Computing”, MIT Press, Cambridge, MA, 1994.

    Google Scholar 

  4. K. K. Goswami, M. Devarakonda, R. K. Iyer, “Prediction-Based Dynamic Load-Sharing Heuristics”, IEEE Trans. Parallel and Distributed Systems, Vol. 4, No. 6, June 1993.

    Article  Google Scholar 

  5. K. G. Shin, C.-J. Hou, “Design and Evaluation of Effective Load Sharing in Distributed Real-Time Systems”, IEEE Trans. Parallel and Distributed Systems, Vol. 5, No. 7, July 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media New York

About this chapter

Cite this chapter

Samadani, M., Kaltofen, E. (1996). Prediction Based Task Scheduling in Distributed Computing. In: Szymanski, B.K., Sinharoy, B. (eds) Languages, Compilers and Run-Time Systems for Scalable Computers. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2315-4_30

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-2315-4_30

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5979-1

  • Online ISBN: 978-1-4615-2315-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics