Structure of multiple activity algorithms

Authors:
John B. Johnston
Affiliations:
Indiana University, Bloomington, Indiana
Venue:
SOSP '69 Proceedings of the second symposium on Operating systems principles
Year:
1969

Citing 1
Cited 4

Computers Then and Now

Journal of the ACM (JACM)

Process Structuring

ACM Computing Surveys (CSUR)
A proposal for certain process management and intercommunication primitives

ACM SIGOPS Operating Systems Review
The TYPESET-10 Message Exchange Facility: a case study in systemic design

ACM SIGOPS Operating Systems Review
An experimental implementation of the kernel/domain architecture

SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles

Quantified Score

Hi-index	0.00

Visualization

Abstract

In conjunction with an earlier paper, this step toward machine design based on the structure of nested-declaration pure-procedure multiple-activity algorithms describes: the declaration, flow-of-control, and some data-addressing mechanisms of such algorithms; the dynamic Saguaro-Garden data-access-providing structure of their Records of Execution ; and implementation in a segmented environment.