Consensus-Oriented Parallelization: How to Earn Your First Million
Consensus-Oriented Parallelization: How to Earn Your First Million
复制标题
面向共识的并行化：如何赚取你的第一个百万
DOI：
10.1145/2814576.2814800
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Rüdiger Kapitza
中科院分区：
文献类型：
--
作者：
Johannes Behl;Tobias Distler;Rüdiger Kapitza
拜占庭容错系统中采用的共识协议是众所周知的计算密集型。不幸的是，以流水线方式执行这种协议的实例的传统方法并不适合现代多核处理器，并且从根本上限制了基于它们的系统的整体性能。为了解决这个问题，我们提出了面向共识的并行化（COP）方案，它将连续的共识实例解开，并通过独立的管道并行执行它们;或者用我们的主要目标，今天的处理器的术语来说：COP是将超标量引入共识协议领域。这样，COP在商品服务器硬件上实现了每秒240万次操作，与在相同代码基础上测量的当代流水线方法相比是6倍，与迄今为止此类系统发布的最高吞吐量相比是20倍以上。然而，更重要的是：COP在单个核心上提供的吞吐量是其竞争对手的3倍，并且它可以利用其他核心，而其他方法受到其管道中最慢阶段的限制。这为要求极高的事务系统的新兴市场提供了拜占庭容错能力，并为传统部署提供了更多空间，以提高其服务质量。
Consensus protocols employed in Byzantine fault-tolerant systems are notoriously compute intensive. Unfortunately, the traditional approach to execute instances of such protocols in a pipelined fashion is not well suited for modern multi-core processors and fundamentally restricts the overall performance of systems based on them. To solve this problem, we present the consensus-oriented parallelization (COP) scheme, which disentangles consecutive consensus instances and executes them in parallel by independent pipelines; or to put it in the terminology of our main target, today's processors: COP is the introduction of superscalarity to the field of consensus protocols. In doing so, COP achieves 2.4 million operations per second on commodity server hardware, a factor of 6 compared to a contemporary pipelined approach measured on the same code base and a factor of over 20 compared to the highest throughput numbers published for such systems so far. More important, however, is: COP provides up to 3 times as much throughput on a single core than its competitors and it can make use of additional cores where other approaches are confined by the slowest stage in their pipeline. This enables Byzantine fault tolerance for the emerging market of extremely demanding transactional systems and gives more room for conventional deployments to increase their quality of service.
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
DOI：
--
发表时间：
1993
期刊：
IEEE J. Sel. Areas Commun.
影响因子：
--
作者：
D. Schmidt;T. Suda
通讯作者：
T. Suda
影响因子：
1.5
作者：
Aublin, Pierre-Louis;Guerraoui, Rachid;Vukolic, Marko
通讯作者：
Vukolic, Marko