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

Cashmere-2L: software coherent shared memory on a clustered remote-write network Cashmere-2L:集群远程写网络上的软件一致共享内存

Proceedings of the sixteenth ACM symposium on Operating systems principles Pub Date : 1997-10-01 DOI: 10.1145/268998.266675

R. Stets, S. Dwarkadas, N. Hardavellas, G. Hunt, L. Kontothanassis, S. Parthasarathy, M. Scott

{"title":"Cashmere-2L: software coherent shared memory on a clustered remote-write network","authors":"R. Stets, S. Dwarkadas, N. Hardavellas, G. Hunt, L. Kontothanassis, S. Parthasarathy, M. Scott","doi":"10.1145/268998.266675","DOIUrl":"https://doi.org/10.1145/268998.266675","url":null,"abstract":"Low-latency remote-write networks, such as DEC's Memory Channel, provide the possibility of transparent, inexpensive, large-scale shared-memory parallel computing on clusters of shared memory multiprocessors (SMPs). The challenge is to take advantage of hardware shared memory for sharing within an SMP, and to ensure that software overhead is incurred only when actively sharing data across SMPs in the cluster. In this paper, we describe a two-level software coherent shared memory system-Cashmere-2L-that meets this challenge. Cashmere-2L uses hardware to share memory within a node, while exploiting the Memory Channel's remote-write capabilities to implement moderately lazy release consistency with multiple concurrent writers, directories, home nodes, and page-size coherence blocks across nodes. Cashmere-2L employs a novel coherence protocol that allows a high level of asynchrony by eliminating global directory locks and the need for TLB shootdown. Remote interrupts are minimized by exploiting the remote-write capabilities of the Memory Channel network. Cashmere-2L currently runs on an 8-node, 32-processor DEC AlphaServer system. Speedups range from 8 to 31 on 32 processors for our benchmark suite, depending on the application's characteristics. We quantify the importance of our protocol optimizations by comparing performance to that of several alternative protocols that do not share memory in hardware within an SMP, and require more synchronization. In comparison to a one-level protocol that does not share memory in hardware within an SMP, Cashmere-2L improves performance by up to 46%.","PeriodicalId":340271,"journal":{"name":"Proceedings of the sixteenth ACM symposium on Operating systems principles","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129916228","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}

引用次数: 199

CPU reservations and time constraints: efficient, predictable scheduling of independent activities CPU预留和时间限制:高效、可预测的独立活动调度

Proceedings of the sixteenth ACM symposium on Operating systems principles Pub Date : 1997-10-01 DOI: 10.1145/268998.266689

Michael B. Jones, D. Rosu, Marcel-Catalin Rosu

{"title":"CPU reservations and time constraints: efficient, predictable scheduling of independent activities","authors":"Michael B. Jones, D. Rosu, Marcel-Catalin Rosu","doi":"10.1145/268998.266689","DOIUrl":"https://doi.org/10.1145/268998.266689","url":null,"abstract":"Workstations and personal computers are increasingly being used for applications with real-time characteristics such as speech understanding and synthesis, media computations and I/O, and animation, often concurrently executed with traditional non-real-time workloads. This paper presents a system that can schedule multiple independent activities so that: . activities can obtain minimum guaranteed execution rates with application-specified reservation granularities via CPU Reservations, CPU Reservations, which are of the form reserve X units of time out of every Y units, provide not just an average case execution rate of X/Y over long periods of time, but the stronger guarantee that from any instant of time, by Y time units later, the activity will have executed for at least X time units, . applications can use Time Constraints to schedule tasks by deadlines, with on-time completion guaranteed for tasks with accepted constraints, and . both CPU Reservations and Time Constraints are implemented very efficiently. In particular, . CPU scheduling overhead is bounded by a constant and is not a function of the number of schedulable tasks. Other key scheduler properties are: . activities cannot violate other activities' guarantees, . time constraints and CPU reservations may be used together, separately, or not at all (which gives a round-robin schedule), with well-defined interactions between all combinations, and . spare CPU time is fairly shared among all activities. The Rialto operating system, developed at Microsoft Research, achieves these goals by using a precomputed schedule, which is the fundamental basis of this work.","PeriodicalId":340271,"journal":{"name":"Proceedings of the sixteenth ACM symposium on Operating systems principles","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133636330","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}

引用次数: 361

Free transactions with Rio Vista 与里约Vista免费交易

Proceedings of the sixteenth ACM symposium on Operating systems principles Pub Date : 1997-10-01 DOI: 10.1145/268998.266665

David E. Lowell, Peter M. Chen

引用次数: 155

Cluster-based scalable network services 基于集群的可扩展网络服务

Proceedings of the sixteenth ACM symposium on Operating systems principles Pub Date : 1997-10-01 DOI: 10.1145/268998.266662

A. Fox, S. Gribble, Y. Chawathe, E. Brewer, P. Gauthier

{"title":"Cluster-based scalable network services","authors":"A. Fox, S. Gribble, Y. Chawathe, E. Brewer, P. Gauthier","doi":"10.1145/268998.266662","DOIUrl":"https://doi.org/10.1145/268998.266662","url":null,"abstract":"We identify three fundamental requirements for scalable network services: incremental scalability and overflow growth provisioning, 24x7 availability through fault masking, and cost-effectiveness. We argue that clusters of commodity workstations interconnected by a high-speed SAN are exceptionally well-suited to meeting these challenges for Internet-server workloads, provided the software infrastructure for managing partial failures and administering a large cluster does not have to be reinvented for each new service. To this end, we propose a general, layered architecture for building cluster-based scalable network services that encapsulates the above requirements for reuse, and a service-programming model based on composable workers that perform transformation, aggregation, caching, and customization (TACC) of Internet content. For both performance and implementation simplicity, the architecture and TACC programming model exploit BASE, a weaker-than-ACID data semantics that results from trading consistency for availability and relying on soft state for robustness in failure management. Our architecture can be used as an off the shelf infrastructural platform for creating new network services, allowing authors to focus on the content of the service (by composing TACC building blocks) rather than its implementation. We discuss two real implementations of services based on this architecture: TranSend, a Web distillation proxy deployed to the UC Berkeley dialup IP population, and HotBot, the commercial implementation of the Inktomi search engine. We present detailed measurements of TranSend's performance based on substantial client traces, as well as anecdotal evidence from the TranSend and HotBot experience, to support the claims made for the architecture.","PeriodicalId":340271,"journal":{"name":"Proceedings of the sixteenth ACM symposium on Operating systems principles","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121336634","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}

引用次数: 639

Flexible update propagation for weakly consistent replication 弱一致性复制的灵活更新传播

Proceedings of the sixteenth ACM symposium on Operating systems principles Pub Date : 1997-10-01 DOI: 10.1145/268998.266711

K. Petersen, M. Spreitzer, D. Terry, M. Theimer, A. Demers

引用次数: 611

Application performance and flexibility on exokernel systems exokkernel系统上的应用性能和灵活性

Proceedings of the sixteenth ACM symposium on Operating systems principles Pub Date : 1997-10-01 DOI: 10.1145/268998.266644

M. Kaashoek, K. Mackenzie, D. Engler, G. Ganger, Héctor M. Briceño, R. Hunt, David Mazières, T. Pinckney, R. Grimm, John Jannotti

{"title":"Application performance and flexibility on exokernel systems","authors":"M. Kaashoek, K. Mackenzie, D. Engler, G. Ganger, Héctor M. Briceño, R. Hunt, David Mazières, T. Pinckney, R. Grimm, John Jannotti","doi":"10.1145/268998.266644","DOIUrl":"https://doi.org/10.1145/268998.266644","url":null,"abstract":"The exokernel operating system architecture safely gives untrusted software efficient control over hardware and software resou rces by separating management from protection. This paper describes an exokernel system that allows specialized applications to achieve high performance without sacrificing the performance of unm odified UNIX programs. It evaluates the exokernel architectur e by measuring end-to-end application performance on Xok, an exokernel for Intel x86-based computers, and by comparing Xok’s performance to the performance of two widely-used 4.4BSD UNIX systems (FreeBSD and OpenBSD). The results show that common unmodified UNIX applications can enjoy the benefits of exoker nels: applications either perform comparably on Xok/ExOS and the BSD UNIXes, or perform significantly better. In addition , the results show that customized applications can benefit subst antially from control over their resources (e.g., a factor of eight fo r a Web server). This paper also describes insights about the exokernel approach gained through building three different exokernel systems, and presents novel approaches to resource multiplexing.","PeriodicalId":340271,"journal":{"name":"Proceedings of the sixteenth ACM symposium on Operating systems principles","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124314874","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}

引用次数: 367

Agile application-aware adaptation for mobility 针对移动性的敏捷应用程序感知适应

Proceedings of the sixteenth ACM symposium on Operating systems principles Pub Date : 1997-10-01 DOI: 10.1145/268998.266708

Brian D. Noble, M. Satyanarayanan, D. Narayanan, James Eric Tilton, J. Flinn, Kevin R. Walker

引用次数: 889

Exploiting the non-determinism and asynchrony of set iterators to reduce aggregate file I/O latency 利用set迭代器的非确定性和异步性来减少总的文件I/O延迟

Proceedings of the sixteenth ACM symposium on Operating systems principles Pub Date : 1997-10-01 DOI: 10.1145/268998.266705

D. Steere

引用次数: 43

Automated hoarding for mobile computers 移动电脑的自动囤积

Proceedings of the sixteenth ACM symposium on Operating systems principles Pub Date : 1997-10-01 DOI: 10.1145/268998.266706

G. Kuenning, G. Popek

引用次数: 243

Improving the performance of log-structured file systems with adaptive methods 使用自适应方法提高日志结构文件系统的性能

Proceedings of the sixteenth ACM symposium on Operating systems principles Pub Date : 1997-10-01 DOI: 10.1145/268998.266700

Jeanna Neefe Matthews, D. Roselli, Adam M. Costello, Randolph Y. Wang, T. Anderson

引用次数: 200