ACM Home Page
Please provide us with feedback. Feedback
Using type-extension to organize virtual-memory mechanisms
Full text PdfPdf (1.09 MB)
Source ACM SIGOPS Operating Systems Review archive
Volume 15 ,  Issue 4  (October 1981) table of contents
Pages: 6 - 38  
Year of Publication: 1981
ISSN:0163-5980
Author
P. A. Janson  IBM Zurich Research Laboratory, 8803 Rüschlikon, Switzerland
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 12,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/850716.850718
What is a DOI?

ABSTRACT

Much effort is currently being devoted to producing computer systems that are easy to understand, to verify and to develop. The general methodology for designing such a system consists of decomposing it into a structured set of modules so that the modules can be understood, verified and developed individually, and so that the understanding/verification of the system can be derived from the understanding/verification of its modules. While many of the mechanisms in a computer system have been decomposed successfully into a structured set of modules, no technique has been proposed to organize the virtual memory mechanism of a system in such a way.The present paper proposes using type extension for that purpose. The virtaul memory mechanism consists of a set of type manager modules implementing abstract information containers. The structure of the mechanism reflects the structure of the containers that are implemented. While using type extension to organize a virtual memory mechanism is conceptually simple, it is hard to achieve in practice. All existing or proposed uses of type extension assume the existence of information containers that are uniformly accessible, can always be grown and are protected. Using type extension inside a virtual memory mechanism raises implementation problems since such containers are not implemented. Their implementation is precisely the objective of the virtual memory mechanism. In addition to explaining how type extension can be supported inside a virtual memory mechanism, the paper briefly discusses some aspects of its application to the reorganization of the kernal of a commercial, general-purpose, time-sharing system. It concludes by presenting some results of that case study concerning the organization of operating systems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
Schiller, W. L. (republished May 1975), The Design and Specification of Security Kernel for the PDP-11/45. ESD-TR-75-69 and MTR-2934, Mitre Corporation.
 
4
Ames, S. R. (April 1975), The Design of a Security Kernel. M75-212 Mitre Corporation.
 
5
 
6
Saxena, A. R. (Jan. 1976), A Verified Specification of a Hierarchical Operating System. TR-107, Stanford Electronics Labs.
7
 
8
Neumann, P. G. et al. (June 1975, partly modified Dec. 1975), A Provably Secure Operating System, SRI Final Rep.
 
9
Liskov, B. H. (Feb. 1976), A Note on CLU. CSG Memo 136, Laboratory for Computer Science, M.I.T.
 
10
 
11
12
13
 
14
Liskov, B. H. (1972), A Design Methodology for Reliable Software Systems. Proc. AFIPS FJCC, vol. 41, pp. 191--199.
 
15
Parnas, D. L. (March 1976), Some Hypotheses about the "Uses" Hierarchy for Operating Systems. Res. BS I 76/1, Tech. Hochschule Darmstadt, Fachbereich Informatik.
16
 
17
Parnas, D. L. (Aug. 1971), Information Distribution Aspects of Design Methodology. Proc. IFIP Congress, pp. 340--344.
 
18
 
19
Introduction to Multics. (Feb. 1974), MAC-TR-123, Laboratory for Computer Science, M.I.T.
20
 
21
 
22