Abstract
Operating systems have so far tended to be regarded as a set of largely independent processes. After all, the functions that are being performed are clearly defined and largely self-contained. In theory, many of these processes could be run in parallel, and if a multiprocessor system were available, then separate processors could be allocated for them. In a single processor system, the processes have to be multiprogrammed, switching from one process to another according to a suitable scheduling algorithm.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
10.9 References and bibliography
E.W. Dijkstra (1968a). ‘Cooperating Sequential Processes’, Programming Languages, (ed. F. Genuys), Academic Press, New York.
E.W. Dijkstra (1968b). ‘The Structure of the THE Multiprogramming System’, Communications of the ACM, Vol. 11, pp. 341–6.
E.W. Dijkstra (1965). ‘Solution of a Problem in Concurrent Programming Control’, Communications of the ACM, Vol. 8, p. 569.
L. Lamport (1968). ‘The Mutual Exclusion Problem: Part I — A Theory of Interprocess Communication’, Journal of the ACM, Vol. 33, No. 2, pp. 313–26.
L. Lamport (1968). ‘The Mutual Exclusion Problem: Part II — Statement and Solutions’, Journal of the ACM, Vol. 33, No. 2, pp. 327–48.
M. Raynal (1986). Algorithms for Mutual Exclusion, MIT Press, Cambridge, Mass.
Author information
Authors and Affiliations
Copyright information
© 1993 Colin J. Theaker and Graham R. Brookes
About this chapter
Cite this chapter
Theaker, C.J., Brookes, G.R. (1993). Process Synchronisation — Basic Principles. In: Concepts of Operating Systems. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-11511-2_10
Download citation
DOI: https://doi.org/10.1007/978-1-349-11511-2_10
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-52366-7
Online ISBN: 978-1-349-11511-2
eBook Packages: EngineeringEngineering (R0)