Automatically Tolerating Arbitrary Faults in Non-malicious Settings
Automatically Tolerating Arbitrary Faults in Non-malicious Settings
复制标题
自动容忍非恶意设置中的任意故障
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
C. Fetzer
中科院分区：
文献类型：
--
作者：
Diogo Behrens;Stefan Weigert;C. Fetzer
在商品硬件数据中心中经常观察到诸如位翻转之类的任意故障，并导致大型服务中断。尽管如此，诸如崩溃和消息遗漏之类的良性故障仍然是实际容错分布式系统中的标准假设。容忍任意错误的算法更难理解并且部署成本更高（需要更多机器）。在这项工作中，我们引入了一种非恶意任意故障模型，包括瞬时和永久任意故障，例如位翻转和硬件设计错误，但不包括通常由安全漏洞引起的恶意故障。然后，我们提出了一个基于编译器的框架，允许良性容错算法自动容忍非恶意设置中的任意错误。最后，我们通过实验评估了两种基本算法：Paxos 和领导者选举。以 CPU 周期为代价，转换后的算法使用与良性容错算法相同数量的进程，并且几乎没有网络开销，同时将任意失败的概率降低了两个数量级。
Arbitrary faults such as bit flips have been often observed in commodity-hardware data centers and have disrupted large services. Benign faults, such as crashes and message omissions, are nevertheless the standard assumption in practical fault-tolerant distributed systems. Algorithms tolerant to arbitrary faults are harder to understand and more expensive to deploy (requiring more machines). In this work, we introduce a non-malicious arbitrary fault model including transient and permanent arbitrary faults, such as bit flips and hardware-design errors, but no malicious faults, typically caused by security breaches. We then present a compiler-based framework that allows benign fault-tolerant algorithms to automatically tolerate arbitrary faults in non-malicious settings. Finally, we experimentally evaluate two fundamental algorithms: Paxos and leader election. At expense of CPU cycles, transformed algorithms use the same number of processes as their benign fault-tolerant counterparts, and have virtually no network overhead, while reducing the probability of failing arbitrarily by two orders of magnitude.
DOI：
10.1145/2168836.2168866
发表时间：
2012-04
期刊：
--
影响因子：
--
作者：
R. Kapitza;J. Behl;C. Cachin;T. Distler;Simon Kuhnle;Seyed Vahid Mohammadi;Wolfgang Schröder-Preikschat;Klaus Stengel
通讯作者：
R. Kapitza;J. Behl;C. Cachin;T. Distler;Simon Kuhnle;Seyed Vahid Mohammadi;Wolfgang Schröder-Preikschat;Klaus Stengel