Abstract
Up to this point in the development of our paper operating system we have assumed that all processes have the resources they need. It is now time to consider how processes acquire their resources, and how a limited set of resources can be effectively shared among several processes. Our discussion of resource allocation will also include scheduling since the two functions are closely related: decisions on process priority can be dependent on where resources are committed, and the introduction of new processes into the system is clearly influenced by the amount of spare resource capacity. In fact scheduling, being concerned with the allocation of central processors, can be regarded as a subtopic of resource allocation as a whole.
Access this chapter
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lister, A.M. (1984). Resource Allocation and Scheduling. In: Fundamentals of Operating Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-2686-9_8
Download citation
DOI: https://doi.org/10.1007/978-1-4899-2686-9_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4899-2688-3
Online ISBN: 978-1-4899-2686-9
eBook Packages: Springer Book Archive