发布求助
文献互助 智能选刊 最新文献

Proceedings of the fifth ACM symposium on Operating systems principles最新文献

筛选
英文 中文
Computational processor demands of Algol-60 programs Algol-60程序的计算处理器需求
Proceedings of the fifth ACM symposium on Operating systems principles Pub Date : 1975-11-01 DOI: 10.1145/800213.806533
R. Brundage, A. Batson
{"title":"Computational processor demands of Algol-60 programs","authors":"R. Brundage, A. Batson","doi":"10.1145/800213.806533","DOIUrl":"https://doi.org/10.1145/800213.806533","url":null,"abstract":"The characteristics of computational processor requirements of a sample of Algol-60 programs have been measured. Distributions are presented for intervals of processor activity as defined by input-output requests and segment allocation requests occurring within the Johnston contour model and within a stack model in which array allocations are treated separately. The results provide new empirical data concerning the behavior of this class of programs. Some implications of the empirical results which may influence computer system design and performance are presented and discussed.","PeriodicalId":191892,"journal":{"name":"Proceedings of the fifth ACM symposium on Operating systems principles","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125648525","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}
引用次数: 3
Policy/mechanism separation in Hydra Hydra中的策略/机制分离
Proceedings of the fifth ACM symposium on Operating systems principles Pub Date : 1975-11-01 DOI: 10.1145/800213.806531
R. Levin, E. Cohen, W. Corwin, F. Pollack, W. Wulf
{"title":"Policy/mechanism separation in Hydra","authors":"R. Levin, E. Cohen, W. Corwin, F. Pollack, W. Wulf","doi":"10.1145/800213.806531","DOIUrl":"https://doi.org/10.1145/800213.806531","url":null,"abstract":"The extent to which resource allocation policies are entrusted to user-level software determines in large part the degree of flexibility present in an operating system. In Hydra the determination to separate mechanism and policy is established as a basic design principle and is implemented by the construction of a kernel composed (almost) entirely of mechanisms. This paper presents three such mechanisms (scheduling, paging, protection) and examines how external policies which manipulate them may be constructed. It is shown that the policy decisions which remain embedded in the kernel exist for the sole purpose of arbitrating conflicting requests for physical resources, and then only to the extent of guaranteeing fairness.","PeriodicalId":191892,"journal":{"name":"Proceedings of the fifth ACM symposium on Operating systems principles","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115439804","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}
引用次数: 203
Scheduling partially ordered tasks with probabilistic execution times 调度具有概率执行时间的部分排序任务
Proceedings of the fifth ACM symposium on Operating systems principles Pub Date : 1975-11-01 DOI: 10.1145/800213.806534
K. Chandy, P. Reynolds
{"title":"Scheduling partially ordered tasks with probabilistic execution times","authors":"K. Chandy, P. Reynolds","doi":"10.1145/800213.806534","DOIUrl":"https://doi.org/10.1145/800213.806534","url":null,"abstract":"The objective of this paper is to relate models of multi-tasking in which task times are known or known to be equal to models in which task times are unknown. We study bounds on completion times and the applicability of optimal deterministic schedules to probabilistic models. Level algorithms are shown to be optimal for forest precedence graphs in which task times are independent and identically distributed exponential or Erlang random variables. A time sharing system simulation shows that multi-tasking could reduce response times and that response time is insensitive to multi-tasking scheduling disciplines.","PeriodicalId":191892,"journal":{"name":"Proceedings of the fifth ACM symposium on Operating systems principles","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126884061","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}
引用次数: 45
Protection in the Hydra Operating System 九头蛇操作系统中的保护
Proceedings of the fifth ACM symposium on Operating systems principles Pub Date : 1975-11-01 DOI: 10.1145/800213.806532
E. Cohen, D. Jefferson
{"title":"Protection in the Hydra Operating System","authors":"E. Cohen, D. Jefferson","doi":"10.1145/800213.806532","DOIUrl":"https://doi.org/10.1145/800213.806532","url":null,"abstract":"This paper describes the capability based protection mechanisms provided by the Hydra Operating System Kernel. These mechanisms support the construction of user-defined protected subsystems, including file and directory subsystems, which do not therefore need to be supplied directly by Hydra. In addition, we discuss a number of well known protection problems, including Mutual Suspicion, Confinement and Revocation, and we present the mechanisms that Hydra supplies in order to solve them.","PeriodicalId":191892,"journal":{"name":"Proceedings of the fifth ACM symposium on Operating systems principles","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123019921","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}
引用次数: 159
Some constraints and tradeoffs in the design of network communications 网络通信设计中的一些约束和权衡
Proceedings of the fifth ACM symposium on Operating systems principles Pub Date : 1975-11-01 DOI: 10.1145/800213.806523
E. Akkoyunlu, K. Ekanandham, R. Huber
{"title":"Some constraints and tradeoffs in the design of network communications","authors":"E. Akkoyunlu, K. Ekanandham, R. Huber","doi":"10.1145/800213.806523","DOIUrl":"https://doi.org/10.1145/800213.806523","url":null,"abstract":"A number of properties and features of interprocess communication systems are presented, with emphasis on those necessary or desirable in a network environment. The interactions between these features are examined, and the consequences of their inclusion in a system are explored. Of special interest are the time-out feature which forces all system table entries to “die of old age” after they have remained unused for some period of time, and the insertion property which states that it is always possible to design a process which may be invisibly inserted into the communication path between any two processes. Though not tied to any particular system, the discussion concentrates on distributed systems of sequential processes (no interrupts) with no system buffering.","PeriodicalId":191892,"journal":{"name":"Proceedings of the fifth ACM symposium on Operating systems principles","volume":"17 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129922591","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}
引用次数: 107
Analysis of a level algorithm for preemptive scheduling 抢占调度的一种层次算法分析
Proceedings of the fifth ACM symposium on Operating systems principles Pub Date : 1975-11-01 DOI: 10.1145/800213.806535
S. Lam, R. Sethi
{"title":"Analysis of a level algorithm for preemptive scheduling","authors":"S. Lam, R. Sethi","doi":"10.1145/800213.806535","DOIUrl":"https://doi.org/10.1145/800213.806535","url":null,"abstract":"Muntz and Coffman give a level algorithm that constructs optimal preemptive schedules on identical processors when the task system is a tree or when there are only two processors. A variation of their algorithm is adapted for processors of different speeds. The algorithm is shown to be optimal on two processors for arbitrary task systems, but not on three or more processors even for trees. Taking the algorithm as a heuristic on m processors and using the ratio of the lengths of the constructed and optimal schedules as a measure, we show that, on identical processors, its performance is bounded by 2 - 2/m. Moreover 2 - 2/m is a best bound in that there exist task systems for which this ratio is approached arbitrarily closely. On processors of different speeds, we derive an upper bound of its performance in terms of the speeds of the given processor system and show that @@@@1.5m is an upper bound over all processor systems. We also give an example of a system for which the bound @@@@m/2 @@@@2 can be approached asymptotically, thus establishing that the @@@@1.5m bound can at most be improved by a constant factor.","PeriodicalId":191892,"journal":{"name":"Proceedings of the fifth ACM symposium on Operating systems principles","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134284665","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}
引用次数: 6
The PDP-11 virtual machine architecture: A case study PDP-11虚拟机体系结构:案例研究
Proceedings of the fifth ACM symposium on Operating systems principles Pub Date : 1975-11-01 DOI: 10.1145/800213.806527
G. Popek, C. Kline
{"title":"The PDP-11 virtual machine architecture: A case study","authors":"G. Popek, C. Kline","doi":"10.1145/800213.806527","DOIUrl":"https://doi.org/10.1145/800213.806527","url":null,"abstract":"At UCLA, a virtual machine system prototype has been constructed for the Digital Equipment Corporation PDP-11/45. In order to successfully implement that system, a number of hardware changes have been necessary. Some overcome basic inadequacies in the original hardware for this purpose, and others enhance the performance of the virtual machine software. Steps in the development of the modified hardware architecture, as well as relevant aspects of the software structure, are discussed. In addition, a case study of interactions between hardware and software developments is presented, together with conclusions motivated by that experience.","PeriodicalId":191892,"journal":{"name":"Proceedings of the fifth ACM symposium on Operating systems principles","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122105085","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}
引用次数: 22
A study of program locality and lifetime functions 程序定域性和生命周期函数的研究
Proceedings of the fifth ACM symposium on Operating systems principles Pub Date : 1975-11-01 DOI: 10.1145/800213.806539
P. Denning, K. C. Kahn
{"title":"A study of program locality and lifetime functions","authors":"P. Denning, K. C. Kahn","doi":"10.1145/800213.806539","DOIUrl":"https://doi.org/10.1145/800213.806539","url":null,"abstract":"A program model can be regarded as decomposible into two main parts. The macromodel captures the phase-transition behavior by specifying locality sets and their associated reference intervals (phases). The micromodel captures the reference patterns within phases. A semi-Markov model can be used at the macro level, while one of the simple early models (such as the random-reference or LRU stack) can be used at the micro level. This paper shows that, even in simplest form, this type of model is capable of reproducing known properties of empirical lifetime functions. A micromodel, alone without a macromodel, is incapable of doing so.","PeriodicalId":191892,"journal":{"name":"Proceedings of the fifth ACM symposium on Operating systems principles","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128935351","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}
引用次数: 63
The network Unix system 网络Unix系统
Proceedings of the fifth ACM symposium on Operating systems principles Pub Date : 1975-11-01 DOI: 10.1145/800213.806522
G. Chesson
{"title":"The network Unix system","authors":"G. Chesson","doi":"10.1145/800213.806522","DOIUrl":"https://doi.org/10.1145/800213.806522","url":null,"abstract":"A Network Interface Program (NIP) is that part of an operating system which interfaces with similar entities in a network. Normally, the NIP is a collection of software routines which implement interprocess communication, interhost protocols, data flow controls, and other necessary executive functions. This paper discusses the organization of the NIP currently being used with the Unix operating system on the ARPA network. The Network Unix system is noteworthy because of the natural way that network and local functions are merged. As a result the network appears as a logical extension to the local system - from the point of view of both the interactive terminal and user program.","PeriodicalId":191892,"journal":{"name":"Proceedings of the fifth ACM symposium on Operating systems principles","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121826129","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}
引用次数: 24
Selecting a scheduling rule that meets pre-specified response time demands 选择满足预定响应时间需求的调度规则
Proceedings of the fifth ACM symposium on Operating systems principles Pub Date : 1975-11-01 DOI: 10.1145/800213.806536
E. Coffman, I. Mitrani
{"title":"Selecting a scheduling rule that meets pre-specified response time demands","authors":"E. Coffman, I. Mitrani","doi":"10.1145/800213.806536","DOIUrl":"https://doi.org/10.1145/800213.806536","url":null,"abstract":"In this paper we study the problem of designing scheduling strategies when the demand on the system is known and waiting time requirements are pre-specified. This important synthesis problem has received little attention in the literature, and contrasts with the common analytical approach to the study of computer service systems. This latter approach contributes only in-directly to the problem of finding satisfactory scheduling rules when the desired (or required) response-time performance is specifiable in advance.","PeriodicalId":191892,"journal":{"name":"Proceedings of the fifth ACM symposium on Operating systems principles","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122188491","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}
引用次数: 8
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信