消息传递系统中的分摊常数轮原子快照
Amortized Constant Round Atomic Snapshot in Message-Passing Systems
摘要:
我们研究了格协议(LA)和原子快照的异步消息传递系统中的问题,多达$f$节点可能会崩溃。我们的主要结果是一个崩溃容忍原子快照算法与\textit{amortized constant round complexity}。据我们所知,Delporte等人[TPDS,18]给出了最佳先验结果,如果扫描次数多于更新次数,则具有摊销的$O(n)$复杂度。如果存在$Ω(\sqrt{k})$操作,则我们的算法实现了摊销常数轮,其中$k$是执行中的实际失败次数,并且由$f$限制。此外,当没有失败时,我们的算法无条件地具有$O(1)$轮复杂度。为了实现摊销常数轮复杂度,我们设计了一个简单的\textit{early-stopping}格协议算法,并使用它来“订购”我们的快照对象的更新和扫描操作。我们的LA算法具有$O(\sqrt{k})$轮复杂度。这是异步系统中第一个早停LA算法。
英文摘要:
We study the lattice agreement (LA) and atomic snapshot problems in asynchronous message-passing systems where up to $f$ nodes may crash. Our main result is a crash-tolerant atomic snapshot algorithm with \textit{amortized constant round complexity}. To the best of our knowledge, the best prior result is given by Delporte et al. [TPDS, 18] with amortized $O(n)$ complexity if there are more scans than updates. Our algorithm achieves amortized constant round if there are $Ω(\sqrt{k})$ operations, where $k$ is the number of actual failures in an execution and is bounded by $f$. Moreover, when there is no failure, our algorithm has $O(1)$ round complexity unconditionally. To achieve amortized constant round complexity, we devise a simple \textit{early-stopping} lattice agreement algorithm and use it to "order" the update and scan operations for our snapshot object. Our LA algorithm has $O(\sqrt{k})$ round complexity. It is the first early-stopping LA algorithm in asynchronous systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。