Abstract | ||
---|---|---|
Reconfigurable state machine replication is an important enabler of elasticity for replicated cloud services, which must be able to dynamically adjust their size as a function of changing load and resource availability. We introduce a new generic framework to allow the reconfigurable state machine implementation to be derived from a collection of arbitrary non-reconfigurable state machines. Our reduction framework follows the black box approach, and does not make any assumptions with respect to its execution environment apart from reliable channels. It allows higher-level services to leverage speculative command execution to ensure uninterrupted progress during the reconfiguration periods as well as in situations where failures prevent the reconfiguration agreement from being reached in a timely fashion. We apply our framework to obtain a reconfigurable speculative state machine from the non-reconfigurable Paxos implementation, and analyze its performance on a realistic distributed testbed. Our results show that our framework incurs negligible overheads in the absence of reconfiguration, and allows steady throughput to be maintained throughout the reconfiguration periods. |
Year | Venue | DocType |
---|---|---|
2015 | arXiv: Distributed, Parallel, and Cluster Computing | Journal |
Volume | Citations | PageRank |
abs/1512.08943 | 0 | 0.34 |
References | Authors | |
12 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Vita Bortnikov | 1 | 230 | 11.98 |
Gregory Chockler | 2 | 1118 | 57.54 |
Dmitri Perelman | 3 | 120 | 7.40 |
Alexey Roytman | 4 | 41 | 4.36 |
Shlomit Shachor | 5 | 3 | 1.45 |
Ilya Shnayderman | 6 | 25 | 2.85 |