{"title":"A NonStop kernel","authors":"J. Bartlett","doi":"10.1145/800216.806587","DOIUrl":"https://doi.org/10.1145/800216.806587","url":null,"abstract":"The Tandem NonStop System is a fault-tolerant [1], expandable, and distributed computer system designed expressly for online transaction processing. This paper describes the key primitives of the kernel of the operating system. The first section describes the basic hardware building blocks and introduces their software analogs: processes and messages. Using these primitives, a mechanism that allows fault-tolerant resource access, the process-pair, is described. The paper concludes with some observations on this type of system structure and on actual use of the system.","PeriodicalId":262012,"journal":{"name":"Proceedings of the eighth ACM symposium on Operating systems principles","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130228091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Accent: A communication oriented network operating system kernel","authors":"R. Rashid, G. Robertson","doi":"10.1145/800216.806593","DOIUrl":"https://doi.org/10.1145/800216.806593","url":null,"abstract":"Accent is a communication oriented operating system kernel being built at Carnegie-Mellon University to support the distributed personal computing project, Spice, and the development of a fault-tolerant distributed sensor network (DSN). Accent is built around a single, powerful abstraction of communication between processes, with all kernel functions, such as device access and virtual memory management accessible through messages and distributable throughout a network. In this paper, specific attention is given to system supplied facilities which support transparent network access and fault-tolerant behavior. Many of these facilities are already being provided under a modified version of VAX/UNIX. The Accent system itself is currently being implemented on the Three Rivers Corp. PERQ.","PeriodicalId":262012,"journal":{"name":"Proceedings of the eighth ACM symposium on Operating systems principles","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120949680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performing remote operations efficiently on a local computer network","authors":"A. Spector","doi":"10.1145/800216.806594","DOIUrl":"https://doi.org/10.1145/800216.806594","url":null,"abstract":"This paper discusses communication among computers connected by a very high speed local network and focuses on ways to support distributed programs that require efficient interprocessor communication. It is motivated by the availability of increasingly high speed local networks and inefficiencies in existing communication subsystems. Mechanisms such as remote procedure calls, monitor calls, and message passing primitives are bases for interprocessor communication at high levels (i.e., within a programming language). At lower levels, interprocessor communication occurs via the transmission of data over some communication medium. On a local network, this basic communication mechanism is the transmission of packets. This paper is concerned with an intermediate communication layer for high speed local networks. To provide overall efficiency, this layer should provide communication primitives that (1) are a good basis on which to implement high level primitives and (2) are specialized enough to be implemented efficiently; for example, in a combination of microcode and hardware. To analyze communication primitives for this intermediate layer, we present a communication model called the remote reference/remote operation model in which a taxonomy of communication primitives is defined. We illustrate the model by describing an implementation of simple communication primitives on Xerox Alto computers interconnected with a 3 megabit Ethernet.","PeriodicalId":262012,"journal":{"name":"Proceedings of the eighth ACM symposium on Operating systems principles","volume":"400 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123915549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sequencing computation steps in a network","authors":"A. Herbert, R. Needham","doi":"10.1145/800216.806592","DOIUrl":"https://doi.org/10.1145/800216.806592","url":null,"abstract":"It is sometimes necessary in the course of a distributed computation to arrange that a certain set of operations is carried out in the correct order and the correct number of times (typically once). If several sets of operations are performed on different machines on the network there is no obvious mechanism for enforcing such ordering constraints in a fully distributed way. This lack basically stems from the difficulty of preventing copying and repetition of messages by machines and from the impossibility of constraining externally the actions of machines in response to messages that come into their hands. This paper presents a possible method for ensuring the integrity of sequences of operations on different machines. The technique may be thought of as a means of enabling machines to ensure that requests made of them are valid and timely, not as means of centralized control of services.","PeriodicalId":262012,"journal":{"name":"Proceedings of the eighth ACM symposium on Operating systems principles","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127510968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Felix File Server","authors":"Marek Fridrich, W. Older","doi":"10.1145/800216.806589","DOIUrl":"https://doi.org/10.1145/800216.806589","url":null,"abstract":"This paper describes Felix - a File Server for an experimental distributed multicomputer system. Felix is designed to support a variety of file systems, virtual memory, and database applications with access being provided by a local area network. Its interface combines block oriented data access with a high degree of crash resistance and a comprehensive set of primitives for controlling data sharing and consistency. An extended set of access modes allows increased concurrency over conventional systems.","PeriodicalId":262012,"journal":{"name":"Proceedings of the eighth ACM symposium on Operating systems principles","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131343398","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ed Lazowska, H. Levy, G. Almes, M. Fischer, R. Fowler, S. Vestal
{"title":"The architecture of the Eden system","authors":"Ed Lazowska, H. Levy, G. Almes, M. Fischer, R. Fowler, S. Vestal","doi":"10.1145/800216.806603","DOIUrl":"https://doi.org/10.1145/800216.806603","url":null,"abstract":"The University of Washington's Eden project is a five-year research effort to design, build and use an “integrated distributed” computing environment. The underlying philosophy of Eden involves a fresh approach to the tension between these two adjectives. In briefest form, Eden attempts to support both good personal computing and good multi-user integration by combining a node machine / local network hardware base with a software environment that encourages a high degree of sharing and cooperation among its users. The hardware architecture of Eden involves an Ethernet local area network interconnecting a number of node machines with bit-map displays, based upon the Intel iAPX 432 processor. The software architecture is object-based, allowing each user access to the information and resources of the entire system through a simple interface. This paper states the philosophy and goals of Eden, describes the programming methodology that we have chosen to support, and discusses the hardware and kernel architecture of the system.","PeriodicalId":262012,"journal":{"name":"Proceedings of the eighth ACM symposium on Operating systems principles","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127227681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design and verification of secure systems","authors":"J. Rushby","doi":"10.1145/800216.806586","DOIUrl":"https://doi.org/10.1145/800216.806586","url":null,"abstract":"This paper reviews some of the difficulties that arise in the verification of kernelized secure systems and suggests new techniques for their resolution. It is proposed that secure systems should be conceived as distributed systems in which security is achieved partly through the physical separation of its individual components and partly through the mediation of trusted functions performed within some of those components. The purpose of a security kernel is simply to allow such a 'distributed' system to actually run within a single processor; policy enforcement is not the concern of a security kernel. This approach decouples verification of components which perform trusted functions from verification of the security kernel. This latter task may be accomplished by a new verification technique called 'proof of separability' which explicitly addresses the security relevant aspects of interrupt handling and other issues ignored by present methods.","PeriodicalId":262012,"journal":{"name":"Proceedings of the eighth ACM symposium on Operating systems principles","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121974312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Proving real-time properties of programs with temporal logic","authors":"A. Bernstein, Paul K. Harter","doi":"10.1145/800216.806585","DOIUrl":"https://doi.org/10.1145/800216.806585","url":null,"abstract":"Wirth [Wi77] categorized programs into three classes. The most difficult type of program to understand and write is a real-time program. Much work has been done in the formal verification of sequential programs, but much remains to be done for concurrent and real-time programs. The critical nature of typical real-time applications makes the validity problem for real-time programs particularly important. Owicki and Lamport [OL80] present a relatively new method for verifying concurrent programs using temporal logic. This paper presents an extension of their work to the area of real-time programs. A model and proof system are presented and their use demonstrated using examples from the literature.","PeriodicalId":262012,"journal":{"name":"Proceedings of the eighth ACM symposium on Operating systems principles","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130815124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kgvin C Kahn, William M Cor~zin, T. D. Dennis, Herman P Hooge, David E. Hubka, Linda A Hutehirts, J. T. Montague, Pred J Pollack, Michael R Gifkins
{"title":"iMAX: A multiprocessor operating system for an object-based computer","authors":"Kgvin C Kahn, William M Cor~zin, T. D. Dennis, Herman P Hooge, David E. Hubka, Linda A Hutehirts, J. T. Montague, Pred J Pollack, Michael R Gifkins","doi":"10.1145/800216.806601","DOIUrl":"https://doi.org/10.1145/800216.806601","url":null,"abstract":"The Intel iAPX 432 is an object-based microcomputer which, together with its operating system iMAX, provides a multiprocessor computer system designed around the ideas of data abstraction. iMAX is implemented in Ada and provides, through its interface and facilities, an Ada view of the 432 system. Of paramount concern in this system is the uniformity of approach among the architecture, the operating system, and the language. Some interesting aspects of both the external and internal views of iMAX are discussed to illustrate this uniform approach.","PeriodicalId":262012,"journal":{"name":"Proceedings of the eighth ACM symposium on Operating systems principles","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125538491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hierarchical Take-Grant Protection systems","authors":"M. Bishop","doi":"10.1145/800216.806598","DOIUrl":"https://doi.org/10.1145/800216.806598","url":null,"abstract":"The application of the Take-Grant Protection Model to hierarchical protection systems is explored. The proposed model extends the results of Wu [7] and applies the results of Bishop and Snyder [2] to obtain necessary and sufficient conditions for a hierarchical protection graph to be secure. In addition, restrictions on the take and grant rules are developed that ensure the security of all graphs generated by these restricted rules.","PeriodicalId":262012,"journal":{"name":"Proceedings of the eighth ACM symposium on Operating systems principles","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131206582","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}