14 Our work focuses on the problem of decomposing consensus algorithms into a common frame15 work composed of simple building blocks. We show that earlier decomposition strategies fall 16 short when applied to some well known algorithms and present a new framework in order to 17 tackle the problem. First we use Aspnes’ framework [2] composed of adopt-commit [5] and con18 ciliator [2] objects in order to decompose the well known Phase-King Byzantine algorithm [4]. 19 We then consider two other well-known algorithms and argue that this framework is insufficient 20 in these (and other) cases and offer a new framework. The framework works in rounds where 21 each consists of two steps. The first step involves an object which detects agreement and the 22 second involves an object that aims at achieving consensus. We denote our newly defined objects 23 as vacillate-adopt-commit and reconciliator . We demonstrate our decomposition on two 24 well known algorithms. Namely, Ben-Or’s Randomized algorithm [3] and the Raft algorithm [6]. 25 2012 ACM Subject Classification Theory of computation→ Models of computation→ Concur26 rency → Distributed computing models 27
分享
引用
