一种最佳自稳定射击队
An Optimal Self-Stabilizing Firing Squad
摘要：
考虑一个完全连接的网络，其中多达$t$进程可能崩溃，并且所有进程都以任意内存状态启动。自稳定射击队问题包括最终保证同时响应外部输入。这是通过要求非崩溃进程在某个正确进程接收到外部“GO”输入时同时“触发”，并且它们仅作为对某个进程接收到这样的输入的响应而触发来建模的。本文介绍了FireAlg，第一个自稳定射击队算法。FireAlg算法在两个方面是最优的：（a）一旦算法处于安全状态，它就像任何其他算法一样快地响应GO输入，以及（b）从任意状态开始，它像任何其他算法一样快地收敛到安全状态。
英文摘要：
Consider a fully connected network where up to $t$ processes may crash, and all processes start in an arbitrary memory state. The self-stabilizing firing squad problem consists of eventually guaranteeing simultaneous response to an external input. This is modeled by requiring that the non-crashed processes "fire" simultaneously if some correct process received an external "GO" input, and that they only fire as a response to some process receiving such an input. This paper presents FireAlg, the first self-stabilizing firing squad algorithm. The FireAlg algorithm is optimal in two respects: (a) Once the algorithm is in a safe state, it fires in response to a GO input as fast as any other algorithm does, and (b) Starting from an arbitrary state, it converges to a safe state as fast as any other algorithm does.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
