From Monitors to Monitors: A Primitive History.
Saved in:
| Title: | From Monitors to Monitors: A Primitive History. |
|---|---|
| Authors: | Astarte, Troy K.1 (AUTHOR) t.k.astarte@swansea.ac.uk |
| Source: | Minds & Machines. 2024 Suppl 1, Vol. 34, p51-71. 21p. |
| Subjects: | Programming languages, History of computers |
| Abstract: | As computers became multi-component systems in the 1950s, handling the speed differentials efficiently was identified as a major challenge. The desire for better understanding and control of 'concurrency' spread into hardware, software, and formalism. This paper examines the way in which the problem emerged and was handled across various computing cultures from 1955 to 1985. In the machinic culture of the late 1950s, system programs called 'monitors' were used for directly managing synchronisation. Attempts to reframe synchronisation in the subsequent algorithmic culture pushed the problem to a higher level of abstraction; Dijkstra's semaphores were a reaction to the algorithms' complexity. Towards the end of the 1960s, the culture of 'structured programming' created a milieu in which Dijkstra, Hoare, and Brinch Hansen (among others) aimed for a concurrency primitive which embodied the new view of programming. Via conditional critical regions and Dijkstra's 'secretaries', the co-produced 'monitor' appeared to provide the desired encapsulation. The construct received embodiment in a few programming languages; this paper ends by considering Modula and Concurrent Pascal. [ABSTRACT FROM AUTHOR] |
| Copyright of Minds & Machines is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | As computers became multi-component systems in the 1950s, handling the speed differentials efficiently was identified as a major challenge. The desire for better understanding and control of 'concurrency' spread into hardware, software, and formalism. This paper examines the way in which the problem emerged and was handled across various computing cultures from 1955 to 1985. In the machinic culture of the late 1950s, system programs called 'monitors' were used for directly managing synchronisation. Attempts to reframe synchronisation in the subsequent algorithmic culture pushed the problem to a higher level of abstraction; Dijkstra's semaphores were a reaction to the algorithms' complexity. Towards the end of the 1960s, the culture of 'structured programming' created a milieu in which Dijkstra, Hoare, and Brinch Hansen (among others) aimed for a concurrency primitive which embodied the new view of programming. Via conditional critical regions and Dijkstra's 'secretaries', the co-produced 'monitor' appeared to provide the desired encapsulation. The construct received embodiment in a few programming languages; this paper ends by considering Modula and Concurrent Pascal. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 09246495 |
| DOI: | 10.1007/s11023-023-09632-2 |
