Proceedings of the seventeenth ACM symposium on Operating systems principles最新文献_第2页

Building reliable, high-performance communication systems from components 从组件构建可靠、高性能的通信系统

Proceedings of the seventeenth ACM symposium on Operating systems principles Pub Date : 1999-12-12 DOI: 10.1145/319151.319157

Xiaoming Liu, C. Kreitz, R. V. Renesse, J. Hickey, Mark Hayden, K. Birman, R. Constable

引用次数: 47

File system usage in Windows NT 4.0 Windows NT 4.0中的文件系统使用情况

Proceedings of the seventeenth ACM symposium on Operating systems principles Pub Date : 1999-12-12 DOI: 10.1145/319151.319158

W. Vogels

引用次数: 216

Manageability, availability and performance in Porcupine: a highly scalable, cluster-based mail service Porcupine中的可管理性、可用性和性能:一个高度可扩展的、基于集群的邮件服务

Proceedings of the seventeenth ACM symposium on Operating systems principles Pub Date : 1999-12-12 DOI: 10.1145/319151.319152

Yasushi Saito, B. Bershad, Henry M. Levy

引用次数: 173

Design and implementation of a distributed virtual machine for networked computers 网络计算机分布式虚拟机的设计与实现

Proceedings of the seventeenth ACM symposium on Operating systems principles Pub Date : 1999-12-12 DOI: 10.1145/319151.319165

E. G. Sirer, R. Grimm, A. J. Gregory, B. Bershad

引用次数: 94

Progress-based regulation of low-importance processes 低重要性过程的基于进度的调节

Proceedings of the seventeenth ACM symposium on Operating systems principles Pub Date : 1999-12-12 DOI: 10.1145/319151.319168

John R. Douceur, W. Bolosky

{"title":"Progress-based regulation of low-importance processes","authors":"John R. Douceur, W. Bolosky","doi":"10.1145/319151.319168","DOIUrl":"https://doi.org/10.1145/319151.319168","url":null,"abstract":"MS Manners is a mechanism that employs progress-based regulation to prevent resource contention with low-importance processes from degrading the performance of high-importance processes. The mechanism assumes that resource contention that degrades the performance of a high-importance process will also retard the progress of the low-importance process. MS Manners detects this contention by monitoring the progress of the low-importance process and inferring resource contention from a drop in the progress rate. This technique recognizes contention over any system resource, as long as the performance impact on contending processes is roughly symmetric. MS Manners employs statistical mechanisms to deal with stochastic progress measurements; it automatically calibrates a target progress rate, so no manual tuning is required; it supports multiple progress metrics from applications that perform several distinct tasks; and it orchestrates multiple low-importance processes to prevent measurement interference. Experiments with two low-importance applications show that MS Manners can reduce the degradation of high-importance processes by up to an order of magnitude.","PeriodicalId":200853,"journal":{"name":"Proceedings of the seventeenth ACM symposium on Operating systems principles","volume":"546 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113987746","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}

引用次数: 70

The design and implementation of an intentional naming system 有意命名系统的设计和实现

Proceedings of the seventeenth ACM symposium on Operating systems principles Pub Date : 1999-12-12 DOI: 10.1145/319151.319164

William Adjie-Winoto, Elliot Schwartz, H. Balakrishnan, J. Lilley

{"title":"The design and implementation of an intentional naming system","authors":"William Adjie-Winoto, Elliot Schwartz, H. Balakrishnan, J. Lilley","doi":"10.1145/319151.319164","DOIUrl":"https://doi.org/10.1145/319151.319164","url":null,"abstract":"This paper presents the design and implementation of the Intentional Naming System (INS), a resource discovery and service location system for dynamic and mobile networks of devices and computers. Such environments require a naming system that is (i) expressive, to describe and make requests based on specific properties of services, (ii) responsive, to track changes due to mobility and performance, (iii) robust, to handle failures, and (iv) easily configurable. INS uses a simple language based on attributes and values for its names. Applications use the language to describe what they are looking for (i.e., their intent), not where to find things (i.e., not hostnames). INS implements a late binding mechanism that integrates name resolution and message routing, enabling clients to continue communicating with end-nodes even if the name-to-address mappings change while a session is in progress. INS resolvers self-configure to form an application-level overlay network, which they use to discover new services, perform late binding, and maintain weak consistency of names using soft-state name exchanges and updates. We analyze the performance of the INS algorithms and protocols, present measurements of a Java-based implementation, and describe three applications we have implemented that demonstrate the feasibility and utility of INS.","PeriodicalId":200853,"journal":{"name":"Proceedings of the seventeenth ACM symposium on Operating systems principles","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124540662","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}

引用次数: 690

The interactive performance of SLIM: a stateless, thin-client architecture SLIM的交互性能:一个无状态的瘦客户机架构

Proceedings of the seventeenth ACM symposium on Operating systems principles Pub Date : 1999-12-12 DOI: 10.1145/319151.319154

B. K. Schmidt, M. Lam, J. Northcutt

{"title":"The interactive performance of SLIM: a stateless, thin-client architecture","authors":"B. K. Schmidt, M. Lam, J. Northcutt","doi":"10.1145/319151.319154","DOIUrl":"https://doi.org/10.1145/319151.319154","url":null,"abstract":"Taking the concept of thin clients to the limit, this paper proposes that desktop machines should just be simple, stateless I/O devices (display, keyboard, mouse, etc.) that access a shared pool of computational resources over a dedicated interconnection fabric --- much in the same way as a building's telephone services are accessed by a collection of handset devices. The stateless desktop design provides a useful mobility model in which users can transparently resume their work on any desktop console.This paper examines the fundamental premise in this system design that modern, off-the-shelf interconnection technology can support the quality-of-service required by today's graphical and multimedia applications. We devised a methodology for analyzing the interactive performance of modern systems, and we characterized the I/O properties of common, real-life applications (e.g. Netscape, streaming video, and Quake) executing in thin-client environments. We have conducted a series of experiments on the Sun Ray™ 1 implementation of this new system architecture, and our results indicate that it provides an effective means of delivering computational services to a workgroup.We have found that response times over a dedicated network are so low that interactive performance is indistinguishable from a dedicated workstation. A simple pixel encoding protocol requires only modest network resources (as little as a 1Mbps home connection) and is quite competitive with the X protocol. Tens of users running interactive applications can share a processor without any noticeable degradation, and many more can share the network. The simple protocol over a 100Mbps interconnection fabric can support streaming video and Quake at display rates and resolutions which provide a high-fidelity user experience.","PeriodicalId":200853,"journal":{"name":"Proceedings of the seventeenth ACM symposium on Operating systems principles","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124393173","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}

引用次数: 144

Separating key management from file system security 将密钥管理与文件系统安全分离

Proceedings of the seventeenth ACM symposium on Operating systems principles Pub Date : 1999-12-12 DOI: 10.1145/319151.319160

David Mazières, M. Kaminsky, M. Kaashoek, E. Witchel

{"title":"Separating key management from file system security","authors":"David Mazières, M. Kaminsky, M. Kaashoek, E. Witchel","doi":"10.1145/319151.319160","DOIUrl":"https://doi.org/10.1145/319151.319160","url":null,"abstract":"No secure network file system has ever grown to span the Internet. Existing systems all lack adequate key management for security at a global scale. Given the diversity of the Internet, any particular mechanism a file system employs to manage keys will fail to support many types of use.We propose separating key management from file system security, letting the world share a single global file system no matter how individuals manage keys. We present SFS, a secure file system that avoids internal key management. While other file systems need key management to map file names to encryption keys, SFS file names effectively contain public keys, making them self-certifying pathnames. Key management in SFS occurs outside of the file system, in whatever procedure users choose to generate file names.Self-certifying pathnames free SFS clients from any notion of administrative realm, making inter-realm file sharing trivial. They let users authenticate servers through a number of different techniques. The file namespace doubles as a key certification namespace, so that people can realize many key management schemes using only standard file utilities. Finally, with self-certifying pathnames, people can bootstrap one key management mechanism using another. These properties make SFS more versatile than any file system with built-in key management.","PeriodicalId":200853,"journal":{"name":"Proceedings of the seventeenth ACM symposium on Operating systems principles","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133090668","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}

引用次数: 422