分布式计算中的约简第一部分:共识和原子提交任务
Reductions in Distributed Computing Part I: Consensus and Atomic Commitment Tasks
摘要:
本文介绍了分布式计算中约简的几个概念,并研究了两个基本协议任务的约简性质,即共识和原子承诺。我们首先提出了“a la Karp”约简的概念,它是经典Karp约简的分布式计算的一种模拟。然后,我们定义了一个较弱的减少,这是库克减少的类似物。这两个约简分别称为K约简和C约简。我们还介绍了C*-减少的概念,在经典的(即非分布式)系统中没有对应的,这自然会出现在处理对称任务。我们建立了关于这三种约化的各种约化与不可约化定理。我们的主要结果是共识和原子承诺任务的不可比性声明:我们表明,他们是无与伦比的C-减少,除了弹性度为1时,在这种情况下,原子承诺严格比共识。这些结果的一个副作用是,我们的概念的C-减少严格弱于K-减少,即使是不可解决的任务。
英文摘要:
We introduce several notions of reduction in distributed computing, and investigate reduction properties of two fundamental agreement tasks, namely Consensus and Atomic Commitment. We first propose the notion of reduction "a la Karp'', an analog for distributed computing of the classical Karp reduction. We then define a weaker reduction which is the analog of Cook reduction. These two reductions are called K-reduction and C-reduction, respectively. We also introduce the notion of C*-reduction which has no counterpart in classical (namely, non distributed) systems, and which naturally arises when dealing with symmetric tasks. We establish various reducibility and irreducibility theorems with respect to these three reductions. Our main result is an incomparability statement for Consensus and Atomic Commitment tasks: we show that they are incomparable with respect to the C-reduction, except when the resiliency degree is 1, in which case Atomic Commitment is strictly harder than Consensus. A side consequence of these results is that our notion of C-reduction is strictly weaker than the one of K-reduction, even for unsolvable tasks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。