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

筛选
英文 中文
The performance of the Container Shipping I/O system 集装箱运输I/O系统的性能
Proceedings of the fifteenth ACM symposium on Operating systems principles Pub Date : 1995-12-03 DOI: 10.1145/224056.225831
E. Anderson, J. Pasquale
{"title":"The performance of the Container Shipping I/O system","authors":"E. Anderson, J. Pasquale","doi":"10.1145/224056.225831","DOIUrl":"https://doi.org/10.1145/224056.225831","url":null,"abstract":"I/O subsystems, and the APIs used to access them, have long been designed with two basic assumptions. First, I/O is performed to relatively slow disks or terminals, so processor time for I/O operations is available while waiting for devices. Second, optimization is done by guessing the user’s needs, such as a filesystem cache does by assuming locality. This traditional design causes I/O performance problems for modern devices such as video displays and high-speed networks, where the above assumptions are no longer valid. We have designed a high-performance I/O subsystem, and a uniform API through which it is accessed, that gives a user-level programmer greater control, which allows operations to be performed more efficiently, and often optimally. Speedups from 30 to over 700 percent can be demonstrated with our technique. Our API is fully uniform, and yields gains for any form of device, including disks, networks, frame buffers, and even IPC performed through the I/O system. This paper describes our implementation of this mechanism, called Container Shipping, and its measured performance for different kinds of I/O.","PeriodicalId":168455,"journal":{"name":"Proceedings of the fifteenth ACM symposium on Operating systems principles","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131776192","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}
引用次数: 10
Exokernel: an operating system architecture for application-level resource management Exokernel:用于应用程序级资源管理的操作系统架构
Proceedings of the fifteenth ACM symposium on Operating systems principles Pub Date : 1995-12-03 DOI: 10.1145/224056.224076
D. Engler, M. Kaashoek, J. O'Toole
{"title":"Exokernel: an operating system architecture for application-level resource management","authors":"D. Engler, M. Kaashoek, J. O'Toole","doi":"10.1145/224056.224076","DOIUrl":"https://doi.org/10.1145/224056.224076","url":null,"abstract":"Traditional operating systems limit the performance, flexibility, and functionality of applications by fixing the interface and implementation of operating system abstractions such as interprocess communication and virtual memory. The exokernel operating system architecture addresses this problem by providing application-level management of physical resources. In the exokernel architecture, a small kernel securely exports all hardware resources through a low-level interface to untrusted library operating systems. Library operating systems use this interface to implement system objects and policies. This separation of resource protection from management allows application-specific customization of traditional operating system abstractions by extending, specializing, or even replacing libraries. We have implemented a prototype exokemel operating system. Measurements show that most primitive kernel operations (such as exception handling and protected control transfer) are ten to 100 times faster than in Ultrix, a mature monolithic UNIX operating system. In addition, we demonstrate that an exokernel allows applications to control machine resources in ways not possible in traditional operating systems. For instance, virtual memory and interprocess communication abstractions are implemented entirely within an application-level library. Measurements show that application-level virtual memory and interprocess communication primitives are five to 40 times faster than Ultrix's kernel primitives. Compared to state-of-the-art implementations from the literature, the prototype exokernel system is at least five times faster on operations such as exception dispatching and interprocess communication.","PeriodicalId":168455,"journal":{"name":"Proceedings of the fifteenth ACM symposium on Operating systems principles","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114372093","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}
引用次数: 1457
Serverless network file systems 无服务器网络文件系统
Proceedings of the fifteenth ACM symposium on Operating systems principles Pub Date : 1995-12-03 DOI: 10.1145/224056.224066
T. Anderson, M. Dahlin, Jeanna M. Neefe, D. Patterson, D. Roselli, Randolph Y. Wang
{"title":"Serverless network file systems","authors":"T. Anderson, M. Dahlin, Jeanna M. Neefe, D. Patterson, D. Roselli, Randolph Y. Wang","doi":"10.1145/224056.224066","DOIUrl":"https://doi.org/10.1145/224056.224066","url":null,"abstract":"In this paper, we propose a new paradigm for network file system design, serverless network file systems. While traditional network file systems rely on a central server machine, a serverless system utilizes workstations cooperating as peers to provide all file system services. Any machine in the system can store, cache, or control any block of data. Our approach uses this location independence, in combination with fast local area networks, to provide better performance and scalability than traditional file systems. Further, because any machine in the system can assume the responsibilities of a failed component, our serverless design also provides high availability via redundant data storage. To demonstrate our approach, we have implemented a prototype serverless network file system called xFS. Preliminary performance measurements suggest that our architecture achieves its goal of scalability. For instance, in a 32-node xFS system with 32 active clients, each client receives nearly as much read or write throughput as it would see if it were the only active client.","PeriodicalId":168455,"journal":{"name":"Proceedings of the fifteenth ACM symposium on Operating systems principles","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121675886","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}
引用次数: 138
Using annotated interface definitions to optimize RPC 使用带注释的接口定义来优化RPC
Proceedings of the fifteenth ACM symposium on Operating systems principles Pub Date : 1995-12-03 DOI: 10.1145/224056.225833
B. Ford, Mike Hibler, Jay Lepreau
{"title":"Using annotated interface definitions to optimize RPC","authors":"B. Ford, Mike Hibler, Jay Lepreau","doi":"10.1145/224056.225833","DOIUrl":"https://doi.org/10.1145/224056.225833","url":null,"abstract":"Abstract In RPC-based communication, it is useful to distinguish the RPC interface, which is the “network contract” between the client and the server, from the presentation, which is the “programmer’s contract” between the RPC stubs and the code that calls or is called by them. Presentation is usually a fixed function of the RPC interface, but some RPC systems, such as DCE and Concert, support the notion of a flexible presentation or endpoint modifier, allowing controlled modification of the behavior of the stubs on each side without affecting the contract between the client and the server. Up until now, the primary motivation for flexible presentation has been for programmer convenience and improved interoperability. However, we have found flexible presentation also to be useful for optimization of RPC, and in many cases necessary to achieving maximal performance without throwing out the RPC system and resorting to hand-coded stubs. In this paper we provide examples demonstrating this point for a number of different operating systems and IPC transport mechanisms, with RPC performance improvements ranging from 5% to an order of magnitude. In general, we observe that the more efficient the underlying IPC transport mechanism is, the more important it is for the RPC system to support flexible presentation, in order to avoid unnecessary user-space overhead.1","PeriodicalId":168455,"journal":{"name":"Proceedings of the fifteenth ACM symposium on Operating systems principles","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121147341","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}
引用次数: 20
Managing update conflicts in Bayou, a weakly connected replicated storage system 管理Bayou(弱连接复制存储系统)中的更新冲突
Proceedings of the fifteenth ACM symposium on Operating systems principles Pub Date : 1995-12-03 DOI: 10.1145/224056.224070
D. Terry, M. Theimer, K. Petersen, A. Demers, M. Spreitzer, C. Hauser
{"title":"Managing update conflicts in Bayou, a weakly connected replicated storage system","authors":"D. Terry, M. Theimer, K. Petersen, A. Demers, M. Spreitzer, C. Hauser","doi":"10.1145/224056.224070","DOIUrl":"https://doi.org/10.1145/224056.224070","url":null,"abstract":"Bayou is a replicated, weakly consistent storage system designed for a mobile computing environment that includes portable machines with less than ideal network connectivity. To maximize availability, users can read and write any accessible replica. Bayou’s design has focused on supporting application-specific mechanisms to detect and resolve the update conflicts that naturally arise in such a system, ensuring that replicas move towards eventual consistency, and defining a protocol by which the resolution of update conflicts stabilizes. It includes novel methods for conflict detection, called dependency checks, and per -write conflict resolution based on client-provid ed mer ge procedures. To guarantee eventual consistency, Bayou servers must be able to rollback the effects of previously executed writes and redo them according to a global serialization order . Furthermore, Bayou permits clients to observe the results of all writes received by a server , including tentative writes whose conflicts have not been ultimately resolved. This paper presents the motivation for and design of these mechanisms and describes the experiences gained with an initial implementation of the system.","PeriodicalId":168455,"journal":{"name":"Proceedings of the fifteenth ACM symposium on Operating systems principles","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122241515","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}
引用次数: 1190
On micro-kernel construction 微核构造
Proceedings of the fifteenth ACM symposium on Operating systems principles Pub Date : 1995-12-03 DOI: 10.1145/224056.224075
J. Liedtke
{"title":"On micro-kernel construction","authors":"J. Liedtke","doi":"10.1145/224056.224075","DOIUrl":"https://doi.org/10.1145/224056.224075","url":null,"abstract":"From a software-technology point of view, the μ-kernel concept is superior to large integrated kernels. On the other hand, it is widely believed that (a) μ-kernel based systems are inherently inefficient and (b) they are not sufficiently flexible. Contradictory to this belief, we show and support by documentary evidence that inefficiency and inflexibility of current μ-kernels is not inherited from the basic idea but mostly from overloading the kernel and/or from improper implementation. Based on functional reasons, we describe some concepts which must be implemented by a μ-kernel and illustrate their flexibility. Then, we analyze the performance critical points. We show what performance is achievable, that the efficiency is sufficient with respect to macro-kernels and why some published contradictory measurements are not evident. Furthermore, we describe some implementation techniques and illustrate why μ-kernels are inherently not portable, although they improve portability of the whole system.","PeriodicalId":168455,"journal":{"name":"Proceedings of the fifteenth ACM symposium on Operating systems principles","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115003544","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}
引用次数: 689
Hive: fault containment for shared-memory multiprocessors Hive:用于共享内存多处理器的故障控制
Proceedings of the fifteenth ACM symposium on Operating systems principles Pub Date : 1995-12-03 DOI: 10.1145/224056.224059
J. Chapin, M. Rosenblum, Scott Devine, T. Lahiri, D. Teodosiu, Anoop Gupta
{"title":"Hive: fault containment for shared-memory multiprocessors","authors":"J. Chapin, M. Rosenblum, Scott Devine, T. Lahiri, D. Teodosiu, Anoop Gupta","doi":"10.1145/224056.224059","DOIUrl":"https://doi.org/10.1145/224056.224059","url":null,"abstract":"Reliability and scalability are major concerns when designing operating systems for large-scale shared-memory multiprocessors. In this paper we describe Hive, an operating system with a novel kernel architecture that addresses these issues. Hive is structured as an internal distributed system of independent kernels called cells. This improves reliability because a hardware or software fault damages only one cell rather than the whole system, and improves scalability because few kernel resources are shared by processes running on different cells. The Hive prototype is a complete implementation of UNIX SVR4 and is targeted to run on the Stanford FLASH multiprocessor. This paper focuses on Hive's solution to the following key challenges : (1) fault containment, i.e. confining the effects of hardware or software faults to the cell where they occur. and (2) memory sharing among cells, which is required to achieve application performance competitive with other multiprocessor operating systems. Fault containment in a shared-memory multiprocessor requires defending each cell against erroneous writes caused by faults in other cells. Hive prevents such damage by using the FLASH firewall, a write permission bit-vector associated with each page of memory, and by discarding potentially corrupt pages when a fault is detected. Memory sharing is provided through a unified file and virtual memory page cache across the cells, and through a unified free page frame pool. We report early experience with the system, including the results of fault injection and performance experiments using SimOS, an accurate simulator of FLASH. The effects of faults were contained to the cell in which they occurred in all 49 tests where we injected fail-stop hardware faults, and in all 20 tests where we injected kernel data corruption. The Hive prototype executes test workloads on a four-processor four-cell system with between 0% and 11% slowdown as compared to SGI IRIX 5.2 (the version of UNIX on which it is based).","PeriodicalId":168455,"journal":{"name":"Proceedings of the fifteenth ACM symposium on Operating systems principles","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126871128","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}
引用次数: 168
A real-time upcall facility for protocol processing with QoS guarantees 具有QoS保证的协议处理的实时向上调用设施
Proceedings of the fifteenth ACM symposium on Operating systems principles Pub Date : 1995-12-03 DOI: 10.1145/224056.225835
R. Gopalakrishnan, G. Parulkar
{"title":"A real-time upcall facility for protocol processing with QoS guarantees","authors":"R. Gopalakrishnan, G. Parulkar","doi":"10.1145/224056.225835","DOIUrl":"https://doi.org/10.1145/224056.225835","url":null,"abstract":"","PeriodicalId":168455,"journal":{"name":"Proceedings of the fifteenth ACM symposium on Operating systems principles","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128152484","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}
引用次数: 44
Going threadbare (panel session): sense or sedition? a debate on the threads abstraction 老生常谈(小组讨论):理智还是煽动?关于线程抽象的争论
Proceedings of the fifteenth ACM symposium on Operating systems principles Pub Date : 1995-12-03 DOI: 10.1145/224056.224074
M. Baker
{"title":"Going threadbare (panel session): sense or sedition? a debate on the threads abstraction","authors":"M. Baker","doi":"10.1145/224056.224074","DOIUrl":"https://doi.org/10.1145/224056.224074","url":null,"abstract":"","PeriodicalId":168455,"journal":{"name":"Proceedings of the fifteenth ACM symposium on Operating systems principles","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120876601","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}
引用次数: 0
SMART: a processor scheduler for multimedia applications SMART:多媒体应用程序的处理器调度程序
Proceedings of the fifteenth ACM symposium on Operating systems principles Pub Date : 1995-12-03 DOI: 10.1145/224056.225837
Jason Nieh, M. Lam
{"title":"SMART: a processor scheduler for multimedia applications","authors":"Jason Nieh, M. Lam","doi":"10.1145/224056.225837","DOIUrl":"https://doi.org/10.1145/224056.225837","url":null,"abstract":"Applications that manipulate digital audio and video represent a growing class of computations executed by workstation users. This class of computations is known as continuous media. Their distinguishing characteristic is that they must process and transport media samples within application-specific time constraints. To support these real-time activities, the operating system must manage resources so that their time constraints can be satisfied whenever possible.","PeriodicalId":168455,"journal":{"name":"Proceedings of the fifteenth ACM symposium on Operating systems principles","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126538752","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}
引用次数: 17
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学术官方微信