一种异步保守并行更新协议的解扰和加速
Desynchronization and Speedup in an Asynchronous Conservative Parallel Update Protocol
摘要：
在一个状态更新协议的$L$异步并行进程的系统，只与最近的邻居通信，全球desquilization在操作时间可以推导出相应的虚拟时域（VTH）的动力学粗糙。通过分析VTH的微观结构，可以推断出并行处理环境的利用率。我们给出了一个概述的方法，非平衡表面生长（复杂系统的物理学）可以应用于发现一些属性的状态更新算法中使用的分布式并行离散事件模拟（PDES）。特别是，我们专注于在环形通信拓扑结构的异步保守PDES算法。其VTH的时间演化的数值模拟异步细胞自动机，其更新规则对应于该算法所遵循的更新规则。我们给出了性能的理论估计，作为$L$和每个处理器的负载的函数，即，平均加速比和去噪声化的近似公式。它是建立在，对于一个给定的模拟大小，有一个理论上的上限的desertification和理论上的非零下限的利用率。在本章中概述的性能研究的新方法，是特别有用的搜索设计的新一代的算法，将有效地进行自主或可调同步。
英文摘要：
In a state-update protocol for a system of $L$ asynchronous parallel processes that communicate only with nearest neighbors, global desynchronization in operation times can be deduced from kinetic roughening of the corresponding virtual-time horizon (VTH). The utilization of the parallel processing environment can be deduced by analyzing the microscopic structure of the VTH. We give an overview of how the methods of non-equilibrium surface growth (physics of complex systems) can be applied to uncover some properties of state update algorithms used in distributed parallel discrete-event simulations (PDES). In particular, we focus on the asynchronous conservative PDES algorithm in a ring communication topology. The time evolution of its VTH is simulated numerically as asynchronous cellular automaton whose update rule corresponds to the update rule followed by this algorithm. We give theoretical estimates of the performance as a function of $L$ and the load per processor, i.e., approximate formulas for the mean speedup and for the desynchronization. It is established that, for a given simulation size, there is a theoretical upper bound for the desynchronization and a theoretical non-zero lower bound for the utilization. The new approach to performance studies, outlined in this chapter, is particularly useful in the search for the design of a new-generation of algorithms that would efficiently carry out an autonomous or tunable synchronization.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
