关于异步性、内存与通信：分离与全景
On Asynchrony, Memory, and Communication: Separations and Landscapes
AI总结：
研究机器人在LCM周期下的四种计算模型与多种异步对抗性调度器的相互作用，通过跨模型分析完整刻画了它们之间的计算能力关系，并解答了SSYNCH与ASYNCH优势等开放问题。
摘要：
关于由一组相同的移动计算实体（称为机器人）在欧几里得空间中以 Look-Compute-Move（LCM）周期运行的分布式计算研究，近期集中于更好地理解机器人的计算能力如何依赖于其内部能力（即持久内存、通信）的相互作用，这由四种标准计算模型（OBLOT、LUMI、FSTA 和 FCOM）刻画；以及外部环境施加的条件如何控制机器人的激活及其活动的同步，这些条件被感知和建模为对抗性调度器。我们考虑了一系列对抗性异步调度器，范围从经典的半同步（SSYNCH）和完全异步（ASYNCH）设置，包括调度器（在研究 LCM 周期中操作组合的原子性时出现），其对抗能力介于两者之间。我们提出问题：在对抗性调度器 K1 下的模型 M1（M1(K1)）与在调度器 K2 下的模型 M2（M2(K2)）之间的计算关系是什么？例如，M1(K1) 中的机器人是否比 M2(K2) 中的机器人更强大（即它们能解决更多问题）？我们通过跨模型分析，对所考虑的异步调度器下四种机器人模型的能力之间的计算关系提供了完整刻画，从而回答了所有这些问题。在此过程中，我们还对几个开放问题提供了有条件的解答，包括在无限制可见性情况下 SSYNCH 相对于 ASYNCH 的适当优势这一突出问题。
英文摘要：
Research on distributed computing by a team of identical mobile computational entities, called robots, operating in a Euclidean space in $\mathit{Look}$-$\mathit{Compute}$-$\mathit{Move}$ ($\mathit{LCM}$) cycles, has recently focused on better understanding how the computational power of robots depends on the interplay between their internal capabilities (i.e., persistent memory, communication), captured by the four standard computational models (OBLOT, LUMI, FSTA, and FCOM) and the conditions imposed by the external environment, controlling the activation of the robots and their synchronization of their activities, perceived and modeled as an adversarial scheduler. We consider a set of adversarial asynchronous schedulers ranging from the classical semi-synchronous (SSYNCH) and fully asynchronous (ASYNCH) settings, including schedulers (emerging when studying the atomicity of the combination of operations in the $\mathit{LCM}$ cycles) whose adversarial power is in between those two. We ask the question: what is the computational relationship between a model $M_1$ under adversarial scheduler $K_1$ ($M_1(K_1)$) and a model $M_2$ under scheduler $K_2$ ($M_2(K_2)$)? For example, are the robots in $M_1(K_1)$ more powerful (i.e., they can solve more problems) than those in $M_2(K_2)$? We answer all these questions by providing, through cross-model analysis, a complete characterization of the computational relationship between the power of the four models of robots under the considered asynchronous schedulers. In this process, we also provide qualified answers to several open questions, including the outstanding one on the proper dominance of SSYNCH over ASYNCH in the case of unrestricted visibility.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
