Proceedings of the Twelfth European Conference on Computer Systems最新文献_第3页

The Unwritten Contract of Solid State Drives 《固态硬盘不成文合同》

Proceedings of the Twelfth European Conference on Computer Systems Pub Date : 2017-04-23 DOI: 10.1145/3064176.3064187

Jun He, Sudarsun Kannan, A. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau

引用次数: 80

GfxDoctor: A Holistic Graphics Energy Profiler for Mobile Devices GfxDoctor:移动设备的整体图形能量分析器

Proceedings of the Twelfth European Conference on Computer Systems Pub Date : 2017-04-23 DOI: 10.1145/3064176.3064206

Ning Ding, Y. C. Hu

{"title":"GfxDoctor: A Holistic Graphics Energy Profiler for Mobile Devices","authors":"Ning Ding, Y. C. Hu","doi":"10.1145/3064176.3064206","DOIUrl":"https://doi.org/10.1145/3064176.3064206","url":null,"abstract":"Graphics is one of the major energy drain sources in smartphone apps. To optimize the app graphics energy, however, developers face the challenge of highly complex graphics rendering process, which involves multiple system layers including the app, the framework, the GPU, and the asynchronous interactions among them. Current diagnostic tools can profile the resource usage from certain layers, but fall short in stitching together profiling information across all the layers which is needed to provide developers with the visual effect-energy tradeoff at the app source-code level. In this paper, we design and implement a holistic graphics energy diagnosis tool, GfxDoctor1, that helps developers to systematically diagnose energy inefficiencies in app graphics at the app source-code level, by precisely quantifying (1) the visual effect of each UI update, and (2) the aggregate energy drain spent in traversing the entire frame rendering stack due to each UI update. GfxDoctor overcomes three challenges faced in deriving per-UI-update visual effect and energy accounting, asynchrony across system layers, UI update batching, and \"black-box\" GPU, with two key techniques -- lightweight view-frame-ID-based information flow tracking, and OpenGL record-and-replay plus frame diffing. We show the effectiveness of GfxDoctor by profiling a randomly sampled set of 30 popular Android apps which reveals three types of graphics energy bugs happening in 8 out of the 30 apps. Removing these bugs reduces the app energy drain by 46% to 90%.","PeriodicalId":262089,"journal":{"name":"Proceedings of the Twelfth European Conference on Computer Systems","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115761535","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}

引用次数: 15

Mosaic: Processing a Trillion-Edge Graph on a Single Machine 镶嵌:在一台机器上处理一万亿边图

Proceedings of the Twelfth European Conference on Computer Systems Pub Date : 2017-04-23 DOI: 10.1145/3064176.3064191

Steffen Maass, Changwoo Min, Sanidhya Kashyap, Woon-Hak Kang, Mohan Kumar, Taesoo Kim

引用次数: 158

An Empirical Study on the Correctness of Formally Verified Distributed Systems 形式验证分布式系统正确性的实证研究

Proceedings of the Twelfth European Conference on Computer Systems Pub Date : 2017-04-23 DOI: 10.1145/3064176.3064183

Pedro Fonseca, Kaiyuan Zhang, Xi Wang, A. Krishnamurthy

引用次数: 67

Direct Inter-Process Communication (dIPC): Repurposing the CODOMs Architecture to Accelerate IPC 直接进程间通信(dIPC):重新利用codom架构加速IPC

Proceedings of the Twelfth European Conference on Computer Systems Pub Date : 2017-04-23 DOI: 10.1145/3064176.3064197

L. Vilanova, Marc Jordà, N. Navarro, Yoav Etsion, M. Valero

{"title":"Direct Inter-Process Communication (dIPC): Repurposing the CODOMs Architecture to Accelerate IPC","authors":"L. Vilanova, Marc Jordà, N. Navarro, Yoav Etsion, M. Valero","doi":"10.1145/3064176.3064197","DOIUrl":"https://doi.org/10.1145/3064176.3064197","url":null,"abstract":"In current architectures, page tables are the fundamental mechanism that allows contemporary OSs to isolate user processes, binding each thread to a specific page table. A thread cannot therefore directly call another process's function or access its data; instead, the OS kernel provides data communication primitives and mediates process synchronization through inter-process communication (IPC) channels, which impede system performance. Alternatively, the recently proposed CODOMs architecture provides memory protection across software modules. Threads can cross module protection boundaries inside the same process using simple procedure calls, while preserving memory isolation. We present dIPC (for \"direct IPC\"), an OS extension that repurposes and extends the CODOMs architecture to allow threads to cross process boundaries. It maps processes into a shared address space, and eliminates the OS kernel from the critical path of inter-process communication. dIPC is 64.12× faster than local remote procedure calls (RPCs), and 8.87× faster than IPC in the L4 microkernel. We show that applying dIPC to a multi-tier OLTP web server improves performance by up to 5.12× (2.13× on average), and reaches over 94% of the ideal system efficiency.","PeriodicalId":262089,"journal":{"name":"Proceedings of the Twelfth European Conference on Computer Systems","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128177894","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}

引用次数: 19

Abstracting Multi-Core Topologies with MCTOP 用MCTOP抽象多核拓扑

Proceedings of the Twelfth European Conference on Computer Systems Pub Date : 2017-04-23 DOI: 10.1145/3064176.3064194

Georgios Chatzopoulos, R. Guerraoui, T. Harris, Vasileios Trigonakis

引用次数: 12

Saturn: a Distributed Metadata Service for Causal Consistency Saturn:用于因果一致性的分布式元数据服务

Proceedings of the Twelfth European Conference on Computer Systems Pub Date : 2017-04-23 DOI: 10.1145/3064176.3064210

Manuel Bravo, L. Rodrigues, P. V. Roy

{"title":"Saturn: a Distributed Metadata Service for Causal Consistency","authors":"Manuel Bravo, L. Rodrigues, P. V. Roy","doi":"10.1145/3064176.3064210","DOIUrl":"https://doi.org/10.1145/3064176.3064210","url":null,"abstract":"This paper presents the design, implementation, and evaluation of Saturn, a metadata service for geo-replicated systems. Saturn can be used in combination with several distributed and replicated data services to ensure that remote operations are made visible in an order that respects causality, a requirement central to many consistency criteria. Saturn addresses two key unsolved problems inherent to previous approaches. First, it eliminates the tradeoff between throughput and data freshness, when deciding what metadata to use for tracking causality. Second, it enables genuine partial replication, a key property to ensure scalability when the number of geo-locations increases. Saturn addresses these challenges while keeping metadata size constant, independently of the number of clients, servers, data partitions, and locations. By decoupling metadata management from data dissemination, and by using clever metadata propagation techniques, it ensures that the throughput and visibility latency of updates on a given item are (mostly) shielded from operations on other items or locations. We evaluate Saturn in Amazon EC2 using realistic benchmarks under both full and partial geo-replication. Results show that weakly consistent datastores can lean on Saturn to upgrade their consistency guarantees to causal consistency with a negligible penalty on performance.","PeriodicalId":262089,"journal":{"name":"Proceedings of the Twelfth European Conference on Computer Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127957724","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}

引用次数: 60

The lock holder and the lock waiter pre-emption problems: nip them in the bud using informed spinlocks (I-Spinlock) 锁持有人和锁服务员抢占问题:使用知情自旋锁(I-Spinlock)将它们扼杀在萌芽状态。

Proceedings of the Twelfth European Conference on Computer Systems Pub Date : 2017-04-23 DOI: 10.1145/3064176.3064180

Boris Teabe, Vlad Nitu, A. Tchana, D. Hagimont

{"title":"The lock holder and the lock waiter pre-emption problems: nip them in the bud using informed spinlocks (I-Spinlock)","authors":"Boris Teabe, Vlad Nitu, A. Tchana, D. Hagimont","doi":"10.1145/3064176.3064180","DOIUrl":"https://doi.org/10.1145/3064176.3064180","url":null,"abstract":"In native Linux systems, spinlock's implementation relies on the assumption that both the lock holder thread and lock waiter threads cannot be preempted. However, in a virtualized environment, these threads are scheduled on top of virtual CPUs (vCPU) that can be preempted by the hypervisor at any time, thus forcing lock waiter threads on other vCPUs to busy wait and to waste CPU cycles. This leads to the well-known Lock Holder Preemption (LHP) and Lock Waiter Preemption (LWP) issues. In this paper, we propose I-Spinlock (for Informed Spinlock), a new spinlock implementation for virtualized environments. Its main principle is to only allow a thread to acquire a lock if and only if the remaining time-slice of its vCPU is sufficient to enter and leave the critical section. This is possible if the spinlock primitive is aware (informed) of its time-to-preemption (by the hypervisor). We implemented I-Spinlock in the Xen virtualization system. We show that our solution is compliant with both para-virtual and hardware virtualization modes. We performed extensive performance evaluations with various reference benchmarks and compared our solution to previous solutions. The evaluations demonstrate that I-Spinlock outperforms other solutions, and more significantly when the number of core increases.","PeriodicalId":262089,"journal":{"name":"Proceedings of the Twelfth European Conference on Computer Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122994826","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

ROS: A Rack-based Optical Storage System with Inline Accessibility for Long-Term Data Preservation 面向长期数据保存的内联可访问的机架光存储系统

Proceedings of the Twelfth European Conference on Computer Systems Pub Date : 2017-04-23 DOI: 10.1145/3064176.3064207

Wenrui Yan, Jie Yao, Q. Cao, C. Xie, Hong Jiang

{"title":"ROS: A Rack-based Optical Storage System with Inline Accessibility for Long-Term Data Preservation","authors":"Wenrui Yan, Jie Yao, Q. Cao, C. Xie, Hong Jiang","doi":"10.1145/3064176.3064207","DOIUrl":"https://doi.org/10.1145/3064176.3064207","url":null,"abstract":"The combination of the explosive growth in digital data and the need to preserve much of this data in the long term has made it an imperative to find a more cost-effective way than HDD arrays and more easily accessible way than tape libraries to store massive amounts of data. While modern optical discs are capable of guaranteeing more than 50-year data preservation without migration, individual optical disks' lack of the performance and capacity relative to HDDs or tapes has significantly limited their use in datacenters. This paper presents a Rack-scale Optical disc library System, or ROS in short, that provides a PB-level total capacity and inline accessibility on thousands of optical discs built within a 42U Rack. A rotatable roller and robotic arm separating and fetching the discs are designed to improve disc placement density and simplify the mechanical structure. A hierarchical storage system based on SSD, hard disks and optical discs are presented to hide the delay of mechanical operation. On the other hand, an optical library file system is proposed to schedule mechanical operation and organize data on the tiered storage with a POSIX user interface to provide an illusion of inline data accessibility. We evaluate ROS on a few key performance metrics including operation delays of the mechanical structure and software overhead in a prototype PB-level ROS system. The results show that ROS stacked on Samba and FUSE can provide almost 323MB/s read and 236MB/s write throughput, about 53ms file write and 15ms read latency via 10GbE network for external users, exhibiting its inline accessibility. Besides, ROS is able to effectively hide and virtualize internal complex operational behaviors and be easily deployable in datacenters.","PeriodicalId":262089,"journal":{"name":"Proceedings of the Twelfth European Conference on Computer Systems","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132296195","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}

引用次数: 21

Atomic In-place Updates for Non-volatile Main Memories with Kamino-Tx 原子就地更新的非易失性主存储器与Kamino-Tx

Proceedings of the Twelfth European Conference on Computer Systems Pub Date : 2017-04-23 DOI: 10.1145/3064176.3064215

Amirsaman Memaripour, Anirudh Badam, Amar Phanishayee, Yanqi Zhou, R. Alagappan, K. Strauss, S. Swanson

{"title":"Atomic In-place Updates for Non-volatile Main Memories with Kamino-Tx","authors":"Amirsaman Memaripour, Anirudh Badam, Amar Phanishayee, Yanqi Zhou, R. Alagappan, K. Strauss, S. Swanson","doi":"10.1145/3064176.3064215","DOIUrl":"https://doi.org/10.1145/3064176.3064215","url":null,"abstract":"Data structures for non-volatile memories have to be designed such that they can be atomically modified using transactions. Existing atomicity methods require data to be copied in the critical path which significantly increases the latency of transactions. These overheads are further amplified for transactions on byte-addressable persistent memories where often the byte ranges modified for data structure updates are significantly smaller compared to the granularity at which data can be efficiently copied and logged. We propose Kamino-Tx that provides a new way to perform transactional updates on non-volatile byte-addressable memories (NVM) without requiring any copying of data in the critical path. Kamino-Tx maintains an additional copy of data off the critical path to achieve atomicity. But in doing so Kamino-Tx has to overcome two important challenges of safety and minimizing NVM storage overhead. We propose a more dynamic approach to maintaining the additional copy of data to reduce storage overheads. To further mitigate the storage overhead of using Kamino-Tx in a replicated setting, we develop Kamino-Tx-Chain, a variant of Chain Replication where replicas perform in-place updates and do not maintain data copies locally; replicas in Kamino-Tx-Chain leverage other replicas as copies to roll back or forward for atomicity. Our results show that using Kamino-Tx increases throughput by up to 9.5x for unreplicated systems and up to 2.2x for replicated settings.","PeriodicalId":262089,"journal":{"name":"Proceedings of the Twelfth European Conference on Computer Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129555222","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}

引用次数: 100