Proceedings of the 9th Workshop on Hot Topics in Dependable Systems最新文献

Towards transparent hardening of distributed systems 走向分布式系统的透明强化

Proceedings of the 9th Workshop on Hot Topics in Dependable Systems Pub Date : 2013-11-03 DOI: 10.1145/2524224.2524230

Diogo Behrens, C. Fetzer, F. Junqueira, M. Serafini

{"title":"Towards transparent hardening of distributed systems","authors":"Diogo Behrens, C. Fetzer, F. Junqueira, M. Serafini","doi":"10.1145/2524224.2524230","DOIUrl":"https://doi.org/10.1145/2524224.2524230","url":null,"abstract":"In distributed systems, errors such as data corruption or arbitrary changes to the flow of programs might cause processes to propagate incorrect state across the system. To prevent error propagation in such systems, an efficient and effective technique is to harden processes against Arbitrary State Corruption (ASC) faults through local detection, without replication. For distributed systems designed from scratch, dealing with state corruption can be made fully transparent, but requires that developers follow a few concrete design patterns. In this paper, we discuss the problem of hardening existing code bases of distributed systems transparently. Existing systems have not been designed with ASC hardening in mind, so they do not necessarily follow required design patterns. For such systems, we focus here on both performance and number of changes to the existing code base. Using memcached as an example, we identify and discuss three areas of improvement: reducing the memory overhead, improving access to state variables, and supporting multi-threading. Our initial evaluation of memcached shows that our ASC-hardened version obtains a throughput that is roughly 76% of the throughput of stock memcached with 128-byte and 1k-byte messages.","PeriodicalId":436314,"journal":{"name":"Proceedings of the 9th Workshop on Hot Topics in Dependable Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114776875","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}

引用次数: 6

Using big data for more dependability: a cellular network tale 利用大数据提高可靠性:蜂窝网络的故事

Proceedings of the 9th Workshop on Hot Topics in Dependable Systems Pub Date : 2013-11-03 DOI: 10.1145/2524224.2524227

Nawanol Theera-Ampornpunt, S. Bagchi, Kaustubh R. Joshi, R. Panta

引用次数: 13

An untold story of redundant clouds: making your service deployment truly reliable 关于冗余云的一个不为人知的故事:使您的服务部署真正可靠

Proceedings of the 9th Workshop on Hot Topics in Dependable Systems Pub Date : 2013-11-03 DOI: 10.1145/2524224.2524231

Ennan Zhai, Ruichuan Chen, D. Wolinsky, B. Ford

引用次数: 17

Towards effective and efficient search-based deterministic replay 朝着有效和高效的基于搜索的确定性重播方向发展

Proceedings of the 9th Workshop on Hot Topics in Dependable Systems Pub Date : 2013-11-03 DOI: 10.1145/2524224.2524228

Manuel Bravo, Nuno Machado, P. Romano, L. Rodrigues

引用次数: 7

Towards privacy-preserving fault detection 面向保护隐私的故障检测

Proceedings of the 9th Workshop on Hot Topics in Dependable Systems Pub Date : 2013-11-03 DOI: 10.1145/2524224.2524233

Antonis Papadimitriou, Mingchen Zhao, Andreas Haeberlen

引用次数: 7

Towards efficient, portable application-level consistency 朝着高效、可移植的应用级一致性发展

Proceedings of the 9th Workshop on Hot Topics in Dependable Systems Pub Date : 2013-11-03 DOI: 10.1145/2524224.2524229

T. S. Pillai, Vijay Chidambaram, J. Hwang, A. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau

引用次数: 4

Techniques for efficient in-memory checkpointing 高效的内存检查点技术

Proceedings of the 9th Workshop on Hot Topics in Dependable Systems Pub Date : 2013-11-03 DOI: 10.1145/2524224.2524236

Dirk Vogt, Cristiano Giuffrida, H. Bos, A. Tanenbaum

引用次数: 8

Proceedings of the 9th Workshop on Hot Topics in Dependable Systems 第九届可靠系统热点研讨会论文集

Proceedings of the 9th Workshop on Hot Topics in Dependable Systems Pub Date : 2013-11-03 DOI: 10.1145/2524224

C. Cachin, R. V. Renesse

引用次数: 0

Verifying the correctness of remote executions: from wild implausibility to near practicality 验证远程执行的正确性:从不切实际到近乎实用

Proceedings of the 9th Workshop on Hot Topics in Dependable Systems Pub Date : 2013-11-03 DOI: 10.1145/2524224.2524225

Michael Walfish

{"title":"Verifying the correctness of remote executions: from wild implausibility to near practicality","authors":"Michael Walfish","doi":"10.1145/2524224.2524225","DOIUrl":"https://doi.org/10.1145/2524224.2524225","url":null,"abstract":"How can we trust results computed by a third party, or the integrity of data stored by such a party? This is a classic question in systems security, and it is particularly relevant today, as much computation is now outsourced: it is performed by machines that are rented, remote, or both. Various solutions have been proposed that make assumptions about the class of computations, the failure modes of the performing computer, etc. However, deep results in theoretical computer science---interactive proofs (IPs) [3, 9, 10, 13, 19] and probabilistically checkable proofs (PCPs) [1, 2] (coupled with cryptographic commitments [11, 12] in the context of arguments [5])---tell us that a fully general solution exists that makes no assumptions about the third party: the local computer can check the correctness of a remotely executed computation by inspecting a succinct proof returned by the third party. The rub is practicality: if implemented naively, the theory would be preposterously expensive (e.g., trillions of CPU-years or more to verify simple computations). Over the last several years, a number of projects have brought this theory to near-practicality in the context of implemented systems [4, 6--8, 14--18, 20--22]. The pace of progress has been rapid, and there have been many encouraging developments in this emerging area of proof-based verifiable computation. My talk will cover the high-level problem, the theory that solves the problem in principle, the projects that have reduced the theory to near-practicality and implemented it, and open questions for the area. My hope is to communicate the excitement surrounding all of the projects in the area.","PeriodicalId":436314,"journal":{"name":"Proceedings of the 9th Workshop on Hot Topics in Dependable Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114403877","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

PSCloud: a durable context-aware personal storage cloud PSCloud:一个持久的上下文感知个人存储云

Proceedings of the 9th Workshop on Hot Topics in Dependable Systems Pub Date : 2013-11-03 DOI: 10.1145/2524224.2524235

S. Bazarbayev, M. Hiltunen, Kaustubh R. Joshi, W. Sanders, R. Schlichting

{"title":"PSCloud: a durable context-aware personal storage cloud","authors":"S. Bazarbayev, M. Hiltunen, Kaustubh R. Joshi, W. Sanders, R. Schlichting","doi":"10.1145/2524224.2524235","DOIUrl":"https://doi.org/10.1145/2524224.2524235","url":null,"abstract":"Personal content from mobile devices is often irreplaceable, yet current solutions for managing and synchronizing this data across multiple devices to ensure durability are often limited. A common approach is to synchronize data through a cloud storage service such as Dropbox. We argue that this model is excessively rigid because it forces users to use more expensive cloud storage than is needed. This paper proposes an alternative approach that uses storage on all of a user's mobile devices, home servers, and cloud storage accounts to create a single unified personal storage system called PSCloud in which data is automatically cached, replicated, and placed to enable reliable access across all devices while minimizing network access and storage costs. This approach is based on a per-device network context-graph that tracks connectivity relationships between a user's devices and storage options over time. Preliminary experiments show that combining such context with techniques that exploit content similarity across devices to make placement decisions can lead to substantial reductions in cloud storage and network usage.","PeriodicalId":436314,"journal":{"name":"Proceedings of the 9th Workshop on Hot Topics in Dependable Systems","volume":"44 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120941796","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}

引用次数: 11