Proceedings of the Twelfth European Conference on Computer Systems最新文献

One Primitive to Diagnose Them All: Architectural Support for Internet Diagnostics 一个诊断它们的原语:因特网诊断的体系结构支持

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

Ang Chen, Andreas Haeberlen, Wenchao Zhou, B. T. Loo

{"title":"One Primitive to Diagnose Them All: Architectural Support for Internet Diagnostics","authors":"Ang Chen, Andreas Haeberlen, Wenchao Zhou, B. T. Loo","doi":"10.1145/3064176.3064212","DOIUrl":"https://doi.org/10.1145/3064176.3064212","url":null,"abstract":"Today, network operators are increasingly playing the role of part-time detectives: they must routinely diagnose intricate problems and malfunctions, e.g., routing or performance issues, and they must often perform forensic investigations of past misbehavior, e.g., intrusions or cybercrimes. However, the current Internet architecture offers little direct support for them. A variety of solutions have been proposed, but each solution tends to address only one specific problem. Moreover, each solution proposes a different fix that is incompatible with the others, which complicates deployment. In this paper, we make the observation that most of the existing solutions share a common \"functional core\", which suggests that it may be possible to add a single primitive to the Internet architecture that can support a wide variety of diagnostic and forensic tasks. We then present one specific candidate that we call secure packet provenance (SPP). We show that SPP is easy to add to the current architecture, that it can be implemented efficiently in both software and hardware, and that it can be used to approximate (and sometimes surpass) the capabilities offered by a variety of existing diagnostic and forensic systems.","PeriodicalId":262089,"journal":{"name":"Proceedings of the Twelfth European Conference on Computer Systems","volume":"27 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":"128786624","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

RFP: When RPC is Faster than Server-Bypass with RDMA RFP:当RPC比使用RDMA的服务器旁路更快时

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

Maomeng Su, Mingxing Zhang, Kang Chen, Zhenyu Guo, Yongwei Wu

{"title":"RFP: When RPC is Faster than Server-Bypass with RDMA","authors":"Maomeng Su, Mingxing Zhang, Kang Chen, Zhenyu Guo, Yongwei Wu","doi":"10.1145/3064176.3064189","DOIUrl":"https://doi.org/10.1145/3064176.3064189","url":null,"abstract":"Remote Direct Memory Access (RDMA) has been widely deployed in modern data centers. However, existing usages of RDMA lead to a dilemma between performance and redesign cost. They either directly replace socket-based send/receive primitives with the corresponding RDMA counterpart (server-reply), which only achieves moderate performance improvement; or push performance further by using one-sided RDMA operations to totally bypass the server (server-bypass), at the cost of redesigning the software. In this paper, we introduce two interesting observations about RDMA. First, RDMA has asymmetric performance characteristics, which can be used to improve server-reply's performance. Second, the performance of server-bypass is not as good as expected in many cases, because more rounds of RDMA may be needed if the server is totally bypassed. We therefore introduce a new RDMA paradigm called Remote Fetching Paradigm (RFP). Although RFP requires users to set several parameters to achieve the best performance, it supports the legacy RPC interfaces and hence avoids the need of redesigning application-specific data structures. Moreover, with proper parameters, it can achieve even higher IOPS than that of the previous paradigms. We have designed and implemented an in-memory key-value store based on RFP to evaluate its effectiveness. Experimental results show that RFP improves performance by 1.6×~4× compared with both server-reply and server-bypass paradigms.","PeriodicalId":262089,"journal":{"name":"Proceedings of the Twelfth European Conference on Computer Systems","volume":"35 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":"129335461","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}

引用次数: 71

Rein: Taming Tail Latency in Key-Value Stores via Multiget Scheduling Rein:通过多get调度控制键值存储的尾部延迟

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

Waleed Reda, M. Canini, P. Suresh, Dejan Kostic, Sean Braithwaite

引用次数: 46

COCONUT: Seamless Scale-out of Network Elements 椰子:无缝扩展网络元素

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

S. Ghorbani, Brighten Godfrey

{"title":"COCONUT: Seamless Scale-out of Network Elements","authors":"S. Ghorbani, Brighten Godfrey","doi":"10.1145/3064176.3064201","DOIUrl":"https://doi.org/10.1145/3064176.3064201","url":null,"abstract":"A key use of software-defined networking is to enable scale-out of network data plane elements. Naively scaling networking elements, however, can cause incorrect behavior. For example, we show that an IDS system which operates correctly as a single network element can erroneously and permanently block hosts when it is replicated. In this paper, we provide a system, COCONUT, for seamless scale-out of network forwarding elements; that is, an SDN application programmer can program to what functionally appears to be a single forwarding element, but which may be replicated behind the scenes. To do this, we identify the key property for seamless scale out, weak causality, and guarantee it through a practical and scalable implementation of vector clocks in the data plane. We prove that COCONUT enables seamless scale out of networking elements, i.e., the user-perceived behavior of any COCONUT element implemented with a distributed set of concurrent replicas is provably indistinguishable from its singleton implementation. Finally, we build a prototype of COCONUT and experimentally demonstrate its correct behavior. We also show that its abstraction enables a more efficient implementation of seamless scale-out compared to a naive baseline.","PeriodicalId":262089,"journal":{"name":"Proceedings of the Twelfth European Conference on Computer Systems","volume":"262 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":"115335252","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}

引用次数: 7

High-Throughput Subset Matching on Commodity GPU-Based Systems 基于商用gpu系统的高吞吐量子集匹配

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

Daniele Rogora, M. Papalini, Koorosh Khazaei, Alessandro Margara, Antonio Carzaniga, G. Cugola

{"title":"High-Throughput Subset Matching on Commodity GPU-Based Systems","authors":"Daniele Rogora, M. Papalini, Koorosh Khazaei, Alessandro Margara, Antonio Carzaniga, G. Cugola","doi":"10.1145/3064176.3064190","DOIUrl":"https://doi.org/10.1145/3064176.3064190","url":null,"abstract":"Large-scale information processing often relies on subset matching for data classification and routing. Examples are publish/subscribe and stream processing systems, database systems, social media, and information-centric networking. For instance, an advanced Twitter-like messaging service where users might follow specific publishers as well as specific topics encoded as tag sets must join a stream of published messages with the users and their preferred tag sets so that the user tag set is a subset of the message tags. Subset matching is an old but also notoriously difficult problem. We present TagMatch, a system that solves this problem by taking advantage of a hybrid CPU/GPU stream processing architecture. TagMatch targets large-scale applications with thousands of matching operations per seconds against hundreds of millions of tag sets. We evaluate TagMatch on an advanced message streaming application, with very positive results both in absolute terms and in comparison with existing systems. As a notable example, our experiments demonstrate that TagMatch running on a single, commodity machine with two GPUs can easily sustain the traffic throughput of Twitter even augmented with expressive tag-based selection.","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":"129753532","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}

引用次数: 2

Node.fz: Fuzzing the Server-Side Event-Driven Architecture 节点。fz:模糊服务器端事件驱动架构

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

James C. Davis, Arun Thekumparampil, Dongyoon Lee

{"title":"Node.fz: Fuzzing the Server-Side Event-Driven Architecture","authors":"James C. Davis, Arun Thekumparampil, Dongyoon Lee","doi":"10.1145/3064176.3064188","DOIUrl":"https://doi.org/10.1145/3064176.3064188","url":null,"abstract":"The importance of the Event-Driven Architecture (EDA) has never been greater. Web servers and the IoT alike have begun to adopt the EDA, and the popular server-side EDA framework, Node.js, boasts the world's largest package ecosystem. While multi-threaded programming has been well studied in the literature, concurrency bug characteristics and useful development tools remain largely unexplored for server-side EDA-based applications. We present the first (to the best of our knowledge) concurrency bug characteristic study of real world open-source event-driven applications, based in Node.js. Like multithreaded programs, event-driven programs are prone to concurrency bugs like atomicity violations and order violations. Our study shows the forms that atomicity violations and ordering violations take in the EDA context, and points out the limitations of existing concurrency error detection tools developed for client-side EDA applications. Based on our bug study, we propose Node.fz, a novel testing aid for server-side event-driven programs. Node.fz is a schedule fuzzing test tool for event-driven programs, embodied for server-side Node.js programs. Node.fz randomly perturbs the execution of a Node.js program, allowing Node.js developers to explore a variety of possible schedules. Thanks to its low overhead, Node.fz enables a developer to explore a broader \"schedule space\" with the same test time budget, ensuring that applications will be stable in a wide variety of deployment conditions. We show that Node.fz can expose known bugs much more frequently than vanilla Node.js, and that it can uncover new bugs.","PeriodicalId":262089,"journal":{"name":"Proceedings of the Twelfth European Conference on Computer Systems","volume":"11 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":"129983408","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}

引用次数: 49

SGXBOUNDS: Memory Safety for Shielded Execution SGXBOUNDS:屏蔽执行的内存安全

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

Dmitrii Kuvaiskii, O. Oleksenko, Sergei Arnautov, Bohdan Trach, Pramod Bhatotia, P. Felber, C. Fetzer

{"title":"SGXBOUNDS: Memory Safety for Shielded Execution","authors":"Dmitrii Kuvaiskii, O. Oleksenko, Sergei Arnautov, Bohdan Trach, Pramod Bhatotia, P. Felber, C. Fetzer","doi":"10.1145/3064176.3064192","DOIUrl":"https://doi.org/10.1145/3064176.3064192","url":null,"abstract":"Shielded execution based on Intel SGX provides strong security guarantees for legacy applications running on untrusted platforms. However, memory safety attacks such as Heartbleed can render the confidentiality and integrity properties of shielded execution completely ineffective. To prevent these attacks, the state-of-the-art memory-safety approaches can be used in the context of shielded execution. In this work, we first showcase that two prominent software- and hardware-based defenses, AddressSanitizer and Intel MPX respectively, are impractical for shielded execution due to high performance and memory overheads. This motivated our design of SGXBounds---an efficient memory-safety approach for shielded execution exploiting the architectural features of Intel SGX. Our design is based on a simple combination of tagged pointers and compact memory layout. We implemented SGXBounds based on the LLVM compiler framework targeting unmodified multithreaded applications. Our evaluation using Phoenix, PARSEC, and RIPE benchmark suites shows that SGXBounds has performance and memory overheads of 17% and 0.1% respectively, while providing security guarantees similar to AddressSanitizer and Intel MPX. We have obtained similar results with SPEC CPU2006 and four real-world case studies: SQLite, Memcached, Apache, and Nginx.","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":"127972926","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}

引用次数: 131

Pado: A Data Processing Engine for Harnessing Transient Resources in Datacenters Pado:在数据中心中利用瞬时资源的数据处理引擎

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

Youngseok Yang, Geon‐Woo Kim, Won Wook Song, Yunseong Lee, Andrew Chung, Zhengping Qian, Brian Cho, Byung-Gon Chun

{"title":"Pado: A Data Processing Engine for Harnessing Transient Resources in Datacenters","authors":"Youngseok Yang, Geon‐Woo Kim, Won Wook Song, Yunseong Lee, Andrew Chung, Zhengping Qian, Brian Cho, Byung-Gon Chun","doi":"10.1145/3064176.3064181","DOIUrl":"https://doi.org/10.1145/3064176.3064181","url":null,"abstract":"Datacenters are under-utilized, primarily due to unused resources on over-provisioned nodes of latency-critical jobs. Such idle resources can be used to run batch data analytic jobs to increase datacenter utilization, but these transient resources must be evicted whenever latency-critical jobs require them again. Resource evictions often lead to cascading recomputations, which is usually handled by checkpointing intermediate results on stable storages of eviction-free reserved resources. However, checkpointing has major shortcomings in its substantial overhead of transferring data back and forth. In this work, we step away from such approaches and focus on observing the job structure and the relationships between computations of the job. We carefully mark the computations that are most likely to cause a large number of recomputations upon evictions, to run them reliably using reserved resources. This lets us retain corresponding intermediate results effortlessly without any additional checkpointing. We design Pado, a general data processing engine, which carries out our idea with several optimizations that minimize the number of additional reserved nodes. Evaluation results show that Pado outperforms Spark 2.0.0 by up to 5.1×, and checkpoint-enabled Spark by up to 3.8×.","PeriodicalId":262089,"journal":{"name":"Proceedings of the Twelfth European Conference on Computer Systems","volume":"15 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":"126681220","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}

引用次数: 48

kR^X: Comprehensive Kernel Protection against Just-In-Time Code Reuse kR^X:针对即时代码重用的全面内核保护

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

Marios Pomonis, Theofilos Petsios, A. Keromytis, M. Polychronakis, V. Kemerlis

{"title":"kR^X: Comprehensive Kernel Protection against Just-In-Time Code Reuse","authors":"Marios Pomonis, Theofilos Petsios, A. Keromytis, M. Polychronakis, V. Kemerlis","doi":"10.1145/3064176.3064216","DOIUrl":"https://doi.org/10.1145/3064176.3064216","url":null,"abstract":"The abundance of memory corruption and disclosure vulnerabilities in kernel code necessitates the deployment of hardening techniques to prevent privilege escalation attacks. As more strict memory isolation mechanisms between the kernel and user space, like Intel's SMEP, become commonplace, attackers increasingly rely on code reuse techniques to exploit kernel vulnerabilities. Contrary to similar attacks in more restrictive settings, such as web browsers, in kernel exploitation, non-privileged local adversaries have great flexibility in abusing memory disclosure vulnerabilities to dynamically discover, or infer, the location of certain code snippets and construct code-reuse payloads. Recent studies have shown that the coupling of code diversification with the enforcement of a \"read XOR execute\" (R^X) memory safety policy is an effective defense against the exploitation of userland software, but so far this approach has not been applied for the protection of the kernel itself. In this paper, we fill this gap by presenting kR^X: a kernel hardening scheme based on execute-only memory and code diversification. We study a previously unexplored point in the design space, where a hypervisor or a super-privileged component is not required. Implemented mostly as a set of GCC plugins, kR^X is readily applicable to the x86-64 Linux kernel and can benefit from hardware support (e.g., MPX on modern Intel CPUs) to optimize performance. In full protection mode, kR^X incurs a low runtime overhead of 4.04%, which drops to 2.32% when MPX is available.","PeriodicalId":262089,"journal":{"name":"Proceedings of the Twelfth European Conference on Computer Systems","volume":"36 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":"115321449","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}

引用次数: 58

Proteus: agile ML elasticity through tiered reliability in dynamic resource markets Proteus:在动态资源市场中通过分层可靠性实现敏捷ML弹性

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

A. Harlap, Alexey Tumanov, Andrew Chung, G. Ganger, Phillip B. Gibbons

引用次数: 89