Skip to main content

Part of the book series: Macmillan Computer Science Series

  • 38 Accesses

Abstract

The next facility to be discussed is the scheduling of process activity. The design of the virtual machine enables the software designer to separate considerations of process scheduling from those of process design. The processes think that they have sole use of their own processor and memory. In a one-process-per-processor setup, the processes can be thought of as running continuously, subject only to synchronisation requirements; in this case the scheduling problem does not arise. However, in a multiprocessing environment, the allocation of CPU/memory to the processes must be organised by agencies within the system. As a total concept, scheduling consists of deciding when the CPU/memory will be re-scheduled; how the CPU/memory will be re-scheduled; and which new process will be chosen. When and how to re-schedule have been discussed in the previous chapter. Here we will discuss how the system selects suitable candidate processes when a CPU/memory comes up for re-allocation – the which.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Copyright information

© 1987 S. T. Allworth and R. N. Zobel

About this chapter

Cite this chapter

Allworth, S.T., Zobel, R.N. (1987). Scheduling. In: Introduction to Real-time Software Design. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-18821-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-18821-5_4

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-41792-8

  • Online ISBN: 978-1-349-18821-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics