article

Free access

Structured multiprogramming

Author:

Per Brinch HansenAuthors Info & Claims

Communications of the ACM, Volume 15, Issue 7

Pages 574 - 578

https://doi.org/10.1145/361454.361473

Published: 01 July 1972 Publication History

PDF eReader

Abstract

This paper presents a proposal for structured representation of multiprogramming in a high level language. The notation used explicitly associates a data structure shared by concurrent processes with operations defined on it. This clarifies the meaning of programs and permits a large class of time-dependent errors to be caught at compile time. A combination of critical regions and event variables enables the programmer to control scheduling of resources among competing processes to any degree desired. These concepts are sufficiently safe to use not only within operating systems but also within user programs.

References

[1]

Wirth, N. The programming language Pascal. Acta Informatica 1, 1 (1971), 35-63.

Digital Library

Google Scholar

[2]

Brinch Hansen, P. An outline of a course on operating system principles. International Seminar on Operating System Techniques, Belfast, Northern Ireland, Aug.-Sept. 1971.

Google Scholar

[3]

Hoare, C.A.R. Towards a theory of parallel programming. International Seminar on Operating System Techniques, Belfast, Northern Ireland, Aug.-Sept. 1971.

Google Scholar

[4]

Dijkstra, E.W. Cooperating sequential processes. Technological U., Eindhoven, 1965. Reprinted in Programming Languages, F. Genuys (Ed.), Academic Press, New York, 1968.

Google Scholar

[5]

Conway, M.E. A multiprocessor system design. Proc. AFIPS 1963 FJCC Vol. 24, Spartan Books, New York, pp. 139-146.

Google Scholar

[6]

Courtois, P.J., Heymans, F., and Parnas, D.L. Concurrent control with "readers" and "writers." Comm. ACM 14, 10 (Oct. 1971), 667-668.

Digital Library

Google Scholar

[7]

Brinch Hansen, P. A comparison of two synchronizing concepts. Acta Informatica 1, 3 (1972), 190-199.

Google Scholar

[8]

Brinch Hansen, P. The nucleus of a multiprogramming system. Comm. ACM 13, 4 (Apr. 1970), 1238-250.

Digital Library

Google Scholar

Cited By

View all

Astarte T(2023)From Monitors to Monitors: A Primitive HistoryMinds and Machines10.1007/s11023-023-09632-234:S1(51-71)Online publication date: 5-Apr-2023
https://doi.org/10.1007/s11023-023-09632-2
Itsykson DOkhotin AOparin V(2021)Computational and Proof Complexity of Partial String AvoidabilityACM Transactions on Computation Theory10.1145/344236513:1(1-25)Online publication date: 21-Jan-2021
https://dl.acm.org/doi/10.1145/3442365
Ambainis AKokainis MPrūsis KVihrovs JZajakins A(2021)All Classical Adversary Methods Are Equivalent for Total FunctionsACM Transactions on Computation Theory10.1145/344235713:1(1-20)Online publication date: 28-Jan-2021
https://dl.acm.org/doi/10.1145/3442357
Show More Cited By

Structured multiprogramming
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types

Recommendations

Conditions for the Equivalence of Synchronous and Asynchronous Systems

Synchronous and asynchronous operation of software systems are defined. It is argued that certifying the correct operation of a system in the synchronous mode is significantly simpler than in the asynchronous mode. A series of compile-time and run-time ...
Data-Race-Freedom of Concurrent Programs
APSEC '13: Proceedings of the 2013 20th Asia-Pacific Software Engineering Conference (APSEC) - Volume 01

Reasoning about access isolation in a program that uses locks, transactions or both to coordinate accesses to shared memory is complex and error-prone. The programmer must understand when accesses issued to the same memory by distinct threads, under ...
An efficient lock-aware transactional memory implementation
ICOOOLPS '09: Proceedings of the 4th workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages and Programming Systems

Transactional memory (TM) is an emerging concurrency control mechanism that provides a simple and composable programming model. Unfortunately, transactions violate the semantics of mutual exclusion locks when they execute concurrently. Due to the ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 15, Issue 7

July 1972

209 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/361454

Editor:
M. Stuart Lynn
Rice Univ., Houston, TX

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1972

Published in CACM Volume 15, Issue 7

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

198
Total Citations
View Citations
1,040
Total Downloads

Downloads (Last 12 months)87
Downloads (Last 6 weeks)17

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Astarte T(2023)From Monitors to Monitors: A Primitive HistoryMinds and Machines10.1007/s11023-023-09632-234:S1(51-71)Online publication date: 5-Apr-2023
https://doi.org/10.1007/s11023-023-09632-2
Itsykson DOkhotin AOparin V(2021)Computational and Proof Complexity of Partial String AvoidabilityACM Transactions on Computation Theory10.1145/344236513:1(1-25)Online publication date: 21-Jan-2021
https://dl.acm.org/doi/10.1145/3442365
Ambainis AKokainis MPrūsis KVihrovs JZajakins A(2021)All Classical Adversary Methods Are Equivalent for Total FunctionsACM Transactions on Computation Theory10.1145/344235713:1(1-20)Online publication date: 28-Jan-2021
https://dl.acm.org/doi/10.1145/3442357
(2021)BibliographyThe Art of Multiprocessor Programming10.1016/B978-0-12-415950-1.00033-1(533-540)Online publication date: 2021
https://doi.org/10.1016/B978-0-12-415950-1.00033-1
(2021)Software basicsThe Art of Multiprocessor Programming10.1016/B978-0-12-415950-1.00031-8(497-518)Online publication date: 2021
https://doi.org/10.1016/B978-0-12-415950-1.00031-8
Herlihy MShavit NLuchangco VSpear M(2021)Monitors and blocking synchronizationThe Art of Multiprocessor Programming10.1016/B978-0-12-415950-1.00018-5(183-200)Online publication date: 2021
https://doi.org/10.1016/B978-0-12-415950-1.00018-5
Mäkitalo NFlores-Martin DFlores HLagerspetz EChristophe FIhantola PBabazadeh MHui PMurillo JTarkoma SMikkonen T(2020)Human Data ModelACM Transactions on Computing for Healthcare10.1145/34025241:4(1-39)Online publication date: 30-Sep-2020
https://dl.acm.org/doi/10.1145/3402524
Vargemidis DGerling KSpiel KAbeele VGeurts L(2020)Wearable Physical Activity Tracking Systems for Older Adults—A Systematic ReviewACM Transactions on Computing for Healthcare10.1145/34025231:4(1-37)Online publication date: 30-Sep-2020
https://dl.acm.org/doi/10.1145/3402523
Theil CŠtajner SStuckenschmidt H(2020)Explaining Financial Uncertainty through Specialized Word EmbeddingsACM/IMS Transactions on Data Science10.1145/33430391:1(1-19)Online publication date: 12-Mar-2020
https://dl.acm.org/doi/10.1145/3343039
Duţu ASinclair MBeckmann BWood DChow MMartínez JDuato JEeckhout L(2020)Independent forward progress of work-groupsProceedings of the ACM/IEEE 47th Annual International Symposium on Computer Architecture10.1109/ISCA45697.2020.00087(1022-1035)Online publication date: 30-May-2020
https://dl.acm.org/doi/10.1109/ISCA45697.2020.00087
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Conditions for the Equivalence of Synchronous and Asynchronous Systems

Data-Race-Freedom of Concurrent Programs

An efficient lock-aware transactional memory implementation

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations