Skip to main content

Introduction

  • Chapter
  • First Online:
Scheduling for Parallel Processing

Part of the book series: Computer Communications and Networks ((CCN))

  • 1532 Accesses

Abstract

In this chapter, we introduce scheduling for parallel processing as a field of knowledge. We define and distinguish abstract scheduling concepts and their real implementations. General descriptions are given here because details of many scheduling notions differ in various scheduling paradigms. Examples of scheduling problems are given to demonstrate that scheduling is essential for efficient use of parallel computers. Finally, we introduce the concept of a scheduling model which is crucial to the structure of this book.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and 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
Hardcover Book
USD 109.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

References

  1. I. Ahmad, Y.-K. Kwok, M.-Y. Wu, and W. Shu. CASCH: A tool for computer-aided scheduling. IEEE Concurrency, 8(4):21–33, 2000.

    Article  Google Scholar 

  2. T.L. Casavant and J.G. Kuhl. A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Transactions on Software Engineering, 14(2):141–154, 1988.

    Article  Google Scholar 

  3. A.L. Decegama. The Technology of Parallel Processing. Parallel Processing Architectures and VLSI Hardware Volume I. Prentice-Hall, Englewood Cliffs, 1989.

    Google Scholar 

  4. F. Dong and S.G. Akl. Scheduling algorithms for grid computing: State of the art and open problems. Research Report 504, Queen’s University School of Computing, Kingston, Ont., Canada, 2006.

    Google Scholar 

  5. E.F. Gehringer, D.P. Siewiorek, and Z. Segall. Parallel Processing: The Cm ∗ Experience. Digital Press, Bedford, 1987.

    Google Scholar 

  6. M.D. Grammatikakis, D.F. Hsu, and M. Kraetzel. Parallel System Interconnections and Communications. CRC Press, Boca Raton, 2001.

    Google Scholar 

  7. R. Levin, E.S. Cohen, W.M. Corwin, F.J. Pollack, and W.A. Wulf. Policy/mechanism separation in HYDRA. In ACM Symposium on OS Principles, pages 132–140, 1975.

    Google Scholar 

  8. M. G. Norman and P. Thanisch. Models of machines and computation for mapping in multicomputers. ACM Computing Surveys, 25(3):263–302, 1993.

    Article  Google Scholar 

  9. A.S. Tanenbaum. Modern Operating Systems. Prentice-Hall. Upper Saddle River NJ, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maciej Drozdowski .

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag London Limited

About this chapter

Cite this chapter

Drozdowski, M. (2009). Introduction. In: Scheduling for Parallel Processing. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84882-310-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-310-5_1

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-309-9

  • Online ISBN: 978-1-84882-310-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics