TY - GEN
T1 - Hybrid distributed consensus
AU - Friedman, Roy
AU - Kliot, Gabriel
AU - Kogan, Alex
N1 - Funding Information: This work is partially supported by the Israeli Science Foundation grant 1247/09 and by the Technion Hasso Plattner Research School.
PY - 2013
Y1 - 2013
N2 - Inspired by the proliferation of cloud-based services, this paper studies consensus, one of the most fundamental distributed computing problems, in a hybrid model of computation. In this model, processes (or nodes) exchange information by passing messages or by accessing a reliable and highly-available register hosted in the cloud. The paper presents a formal definition of the model and problem, and studies performance tradeoffs related to using such a register. Specifically, it proves a lower bound on the number of register accesses in deterministic protocols, and gives a simple deterministic protocol that meets this bound when the register is compare-and-swap (CAS). In addition, two efficient protocols are presented; the first one is probabilistic and solves consensus with a single CAS register access in expectation, while the second one is deterministic and requires a single CAS register access when some favorable network conditions occur. A benefit of those protocols is that they can ensure both liveness and safety, and only their efficiency is affected by the probabilistic and timing assumptions.
AB - Inspired by the proliferation of cloud-based services, this paper studies consensus, one of the most fundamental distributed computing problems, in a hybrid model of computation. In this model, processes (or nodes) exchange information by passing messages or by accessing a reliable and highly-available register hosted in the cloud. The paper presents a formal definition of the model and problem, and studies performance tradeoffs related to using such a register. Specifically, it proves a lower bound on the number of register accesses in deterministic protocols, and gives a simple deterministic protocol that meets this bound when the register is compare-and-swap (CAS). In addition, two efficient protocols are presented; the first one is probabilistic and solves consensus with a single CAS register access in expectation, while the second one is deterministic and requires a single CAS register access when some favorable network conditions occur. A benefit of those protocols is that they can ensure both liveness and safety, and only their efficiency is affected by the probabilistic and timing assumptions.
KW - Consensus
KW - cloud computing
KW - lower bounds
KW - message passing
UR - http://www.scopus.com/inward/record.url?scp=84893079529&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-03850-6_11
DO - 10.1007/978-3-319-03850-6_11
M3 - منشور من مؤتمر
SN - 9783319038490
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 145
EP - 159
BT - Principles of Distributed Systems - 17th International Conference, OPODIS 2013, Proceedings
T2 - 17th International Conference on Principles of Distributed Systems, OPODIS 2013
Y2 - 16 December 2013 through 18 December 2013
ER -