Abstract
Operating systems have so far tended to be regarded as a set of largely independent processes. After all, the tasks 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 a separate processor could be allocated for each of 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.
15.8 References
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.
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). Process Synchronisation — 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_15
Download citation
DOI: https://doi.org/10.1007/978-1-349-17138-5_15
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-34678-5
Online ISBN: 978-1-349-17138-5
eBook Packages: Computer ScienceComputer Science (R0)