Abstract
The allocation of storage to the processes in a time-sharing system poses one of the most major problems to the designer of operating systems. If the system is supporting a large number of user processes, say N, in general it is impractical to keep all of them in memory, as on average only 1/N of the store will be in use at any given instant. Apart from the process that is currently running, some processes will be waiting for a time slice and some (usually the overwhelming majority) will be waiting for a response from the user. This latter category is the most problematic, as the typical response that can be expected from the user might be of the order of a few seconds (but might even be hours). Clearly, the system should not allow such a valuable commodity as its main storage to be underutilised to such an extent.
Preview
Unable to display preview. Download preview PDF.
8.4 References
DEC (1980). ‘RL01/02 Disks’. Peripherals Handbook. Digital Equipment Corporation. Maynard, Massachusetts. U.S.A.
Author information
Authors and Affiliations
Copyright information
© 1983 Colin J. Theaker and Graham R. Brookes
About this chapter
Cite this chapter
Theaker, C.J., Brookes, G.R. (1983). Memory Management — Basic Principles. In: A Practical Course on Operating Systems. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-17138-5_8
Download citation
DOI: https://doi.org/10.1007/978-1-349-17138-5_8
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-34678-5
Online ISBN: 978-1-349-17138-5
eBook Packages: Computer ScienceComputer Science (R0)