Skip to main content

Resource Allocation and Scheduling

  • Chapter
Fundamentals of Operating Systems

Part of the book series: Macmillan Computer Science Series ((COMPSS))

  • 49 Accesses

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.

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.

Author information

Authors and Affiliations

Authors

Copyright information

© 1993 A. M. Lister and R. D. Eager

About this chapter

Cite this chapter

Lister, A.M., Eager, R.D. (1993). Resource Allocation and Scheduling. In: Fundamentals of Operating Systems. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-13283-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-13283-6_8

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-59848-1

  • Online ISBN: 978-1-349-13283-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics