Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles最新文献_第4页

Fast crash recovery in RAMCloud 快速崩溃恢复在RAMCloud

Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles Pub Date : 2011-10-23 DOI: 10.1145/2043556.2043560

Diego Ongaro, Stephen M. Rumble, Ryan Stutsman, J. Ousterhout, M. Rosenblum

引用次数: 375

Cells: a virtual mobile smartphone architecture cell:一种虚拟的移动智能手机架构

Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles Pub Date : 2011-10-23 DOI: 10.1145/2043556.2043574

Jeremy Andrus, Chris Dall, Alexander Van't Hof, Oren Laadan, Jason Nieh

{"title":"Cells: a virtual mobile smartphone architecture","authors":"Jeremy Andrus, Chris Dall, Alexander Van't Hof, Oren Laadan, Jason Nieh","doi":"10.1145/2043556.2043574","DOIUrl":"https://doi.org/10.1145/2043556.2043574","url":null,"abstract":"Smartphones are increasingly ubiquitous, and many users carry multiple phones to accommodate work, personal, and geographic mobility needs. We present Cells, a virtualization architecture for enabling multiple virtual smartphones to run simultaneously on the same physical cellphone in an isolated, secure manner. Cells introduces a usage model of having one foreground virtual phone and multiple background virtual phones. This model enables a new device namespace mechanism and novel device proxies that integrate with lightweight operating system virtualization to multiplex phone hardware across multiple virtual phones while providing native hardware device performance. Cells virtual phone features include fully accelerated 3D graphics, complete power, management features, and full telephony functionality with separately assignable telephone numbers and caller ID support. We have implemented a prototype of Cells that supports multiple Android virtual phones on the same phone. Our performance results demonstrate that Cells imposes only modest runtime and memory overhead, works seamlessly across multiple hardware devices including Google Nexus 1 and Nexus S phones, and transparently runs Android applications at native speed without any modifications.","PeriodicalId":20672,"journal":{"name":"Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82262469","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}

引用次数: 236

Secure network provenance 安全的网络来源

Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles Pub Date : 2011-10-23 DOI: 10.1145/2043556.2043584

Wenchao Zhou, Qiong Fei, Arjun Narayan, Andreas Haeberlen, B. T. Loo, M. Sherr

引用次数: 155

PTask: operating system abstractions to manage GPUs as compute devices PTask:将gpu作为计算设备进行管理的操作系统抽象

Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles Pub Date : 2011-10-23 DOI: 10.1145/2043556.2043579

C. Rossbach, J. Currey, M. Silberstein, Baishakhi Ray, E. Witchel

引用次数: 266

Session details: OS Architecture 会话详细信息:操作系统架构

Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles Pub Date : 2011-10-23 DOI: 10.1145/3247977

N. Zeldovich

引用次数: 0

Efficient deterministic multithreading through schedule relaxation 通过调度放松实现高效的确定性多线程

Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles Pub Date : 2011-10-23 DOI: 10.1145/2043556.2043588

Heming Cui, Jingyue Wu, J. Gallagher, Huayang Guo, Junfeng Yang

{"title":"Efficient deterministic multithreading through schedule relaxation","authors":"Heming Cui, Jingyue Wu, J. Gallagher, Huayang Guo, Junfeng Yang","doi":"10.1145/2043556.2043588","DOIUrl":"https://doi.org/10.1145/2043556.2043588","url":null,"abstract":"Deterministic multithreading (DMT) eliminates many pernicious software problems caused by nondeterminism. It works by constraining a program to repeat the same thread interleavings, or schedules, when given same input. Despite much recent research, it remains an open challenge to build both deterministic and efficient DMT systems for general programs on commodity hardware. To deterministically resolve a data race, a DMT system must enforce a deterministic schedule of shared memory accesses, or mem-schedule, which can incur prohibitive overhead. By using schedules consisting only of synchronization operations, or sync-schedule, this overhead can be avoided. However, a sync-schedule is deterministic only for race-free programs, but most programs have races. Our key insight is that races tend to occur only within minor portions of an execution, and a dominant majority of the execution is still race-free. Thus, we can resort to a mem-schedule only for the \"racy\" portions and enforce a sync-schedule otherwise, combining the efficiency of sync-schedules and the determinism of mem-schedules. We call these combined schedules hybrid schedules. Based on this insight, we have built Peregrine, an efficient deterministic multithreading system. When a program first runs on an input, Peregrine records an execution trace. It then relaxes this trace into a hybrid schedule and reuses the schedule on future compatible inputs efficiently and deterministically. Peregrine further improves efficiency with two new techniques: determinism-preserving slicing to generalize a schedule to more inputs while preserving determinism, and schedule-guided simplification to precisely analyze a program according to a specific schedule. Our evaluation on a diverse set of programs shows that Peregrine is deterministic and efficient, and can frequently reuse schedules for half of the evaluated programs.","PeriodicalId":20672,"journal":{"name":"Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72717935","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}

引用次数: 84

Session details: Threads and races 会话细节:线程和竞争

Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles Pub Date : 2011-10-23 DOI: 10.1145/3247979

B. Ford

引用次数: 0

Session details: Key-value 会话详细信息:Key-value

Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles Pub Date : 2011-10-23 DOI: 10.1145/3247972

M. Theimer

引用次数: 0

Atlantis: robust, extensible execution environments for web applications Atlantis:健壮的、可扩展的web应用程序执行环境

Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles Pub Date : 2011-10-23 DOI: 10.1145/2043556.2043577

James W. Mickens, Mohan Dhawan

{"title":"Atlantis: robust, extensible execution environments for web applications","authors":"James W. Mickens, Mohan Dhawan","doi":"10.1145/2043556.2043577","DOIUrl":"https://doi.org/10.1145/2043556.2043577","url":null,"abstract":"Today's web applications run inside a complex browser environment that is buggy, ill-specified, and implemented in different ways by different browsers. Thus, web applications that desire robustness must use a variety of conditional code paths and ugly hacks to deal with the vagaries of their runtime. Our new exokernel browser, called Atlantis, solves this problem by providing pages with an extensible execution environment. Atlantis defines a narrow API for basic services like collecting user input, exchanging network data, and rendering images. By composing these primitives, web pages can define custom, high-level execution environments. Thus, an application which does not want a dependence on Atlantis'predefined web stack can selectively redefine components of that stack, or define markup formats and scripting languages that look nothing like the current browser runtime. Unlike prior microkernel browsers like OP, and unlike compile-to-JavaScript frameworks like GWT, Atlantis is the first browsing system to truly minimize a web page's dependence on black box browser code. This makes it much easier to develop robust, secure web applications.","PeriodicalId":20672,"journal":{"name":"Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88619887","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}

引用次数: 26

Session details: Security 会话详细信息:安全性

Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles Pub Date : 2011-10-23 DOI: 10.1145/1240624.3258885

A. Perrig

引用次数: 0