Abstract
One of the major functions of an operating system is to control the resources within the computer system. Indeed, considering CPU time and store as resources, then undoubtedly it is the most important function. At a slightly more mundane level, processes need to drive peripherals such as magnetic tape decks or exchangeable disc drives, as users want to mount their own media and have close and dedicated control of the peripherals. In this chapter, the problems of allocating resources to the processes in a multiprogramming system will be examined. As with the allocation of processor time and store, there is a dual objective:
-
(1)
To implement particular management policies regarding which users get the ‘best’ service.
-
(2)
To optimise the performance of the system.
The first of these Is somewhat outside the scope of this book and so only the second objective will be discussed.
Preview
Unable to display preview. Download preview PDF.
13.3 References
P. Brinch Hansen (1977). The Architecture of Concurrent Programs. Prentice-Hall, Englewood Cliffs, N.J..
E.G. Coffman. M. Elphiçk and A. Shoshani (1971). ‘System Deadlocks’. Computing Surveys. Vol. 3. pp. 67–78.
A. N. Habermann (1969). ‘Prevention of System Deadlocks’. Communications of the ACM. Vol. 12. pp. 373–385.
A. N. Habermann (1978). ‘System Deadlocks’. Current Trends in Programming Methodology. Vol. III. Prentice-Hall, Englewood Cliffs, N.J.. pp. 256–297.
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). Resource Management — Deadlocks. In: A Practical Course on Operating Systems. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-17138-5_13
Download citation
DOI: https://doi.org/10.1007/978-1-349-17138-5_13
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-34678-5
Online ISBN: 978-1-349-17138-5
eBook Packages: Computer ScienceComputer Science (R0)