arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2310.01976cs.DC
收藏

关于 k-set agreement 的一些新结果

Some New Results With k-set agreement

Delporte-Gallet Carole, Fauconnier Hugues, Safir Mouna

AI总结:

研究分布式系统中 k-set agreement 的可解性,提出在同步消息传递系统中仅需两轮的认证算法,以及在异步共享内存系统中利用快照原语处理崩溃故障的算法,填补了先前研究的空白。

摘要:

本文研究在易发生不同类型进程故障的分布式系统中,n 个进程间 k-set agreement 的可解性。具体探讨两种场景:易发生多达 t 个 Byzantine 故障进程的同步消息传递系统,以及易发生多达 t 个崩溃故障进程的异步共享内存系统。旨在填补先前研究在这些领域留下的空白。对于 Byzantine 故障,考虑带有认证的系统,其中进程具有不可伪造的签名。对于同步消息传递系统,提出一种认证算法,仅需两轮即可实现 k-set agreement,对故障数 t 无约束,其中 k 确定为 k ≥ ⌊n/(n-t)⌋ + 1。事实上,k 的下界为 k ≥ ⌊n/(n-t)⌋,该下界由基于传统共识且需 t+1 轮的算法获得。在异步共享内存系统中,引入一种算法,在 k 值大于 ⌊(n-t)/(n-2t)⌋ + 1 时完成 k-set agreement。该算法使用快照原语处理崩溃故障并实现有效的集合共识。

英文摘要:

In this article, we investigate the solvability of $k$-set agreement among $n$ processes in distributed systems prone to different types of process failures. Specifically, we explore two scenarios: synchronous message-passing systems prone to up to $t$ Byzantine failures of processes. And asynchronous shared memory systems prone to up to $t$ crash failures of processes. Our goal is to address the gaps left by previous works\cite{SSS,AsynchKset} in these areas. For Byzantine failures case we consider systems with authentication where processes have unforgeable signatures. For synchronous message-passing systems, we present an authenticated algorithm that achieves $k$-set agreement in only two rounds, with no constraints on the number of faults $t$, with $k$ determined as $k \geq \lfloor \frac{n}{n-t} \rfloor + 1$. In fact the lower bound for $k$ is $k \geq \lfloor \frac{n}{n-t} \rfloor $ that is obtained by an algorithm based on traditional consensus with $t+1$ rounds. In asynchronous shared memory systems, we introduce an algorithm that accomplishes $k$-set agreement for values of $k$ greater than $ \lfloor \frac{n-t}{n-2t} \rfloor +1$. This algorithm uses a snapshot primitive to handle crash failures and enable effective set agreement.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑