异步系统全局约束保守并行离散事件仿真中的并行算法scalability
Algorithmic scalability in globally constrained conservative parallel discrete event simulations of asynchronous systems
摘要：
我们考虑采用L处理元素，安排在一个环上的异步系统的并行模拟。处理器只在最近的邻居之间通信，并且只有在保证不违反因果关系的情况下才提前它们的本地模拟时间。在没有约束的模拟中，在无限L限制中，利用率缩放（Korniss等人，PRL 84，2000）;但是，虚拟时间范围的宽度发散（即，算法的测量阶段不成比例）。在这项工作中，我们引入了一个移动窗口的全局约束，修改算法，使测量相位尺度以及。我们提出了系统研究的结果，其中系统的大小（即，L和每个处理器的体积负载）以及约束是变化的。该约束消除了虚拟时间范围的极端波动，提供了其宽度的界限，并控制了平均进度速率。窗口约束的宽度可以用作调谐参数，对于每个处理器的给定容量负载，可以调整该调谐参数以优化利用率，从而使效率最大化。这一结果可能会发现许多应用在一般的空间扩展的短距离相互作用系统的演化与异步动力学建模，包括动态蒙特卡罗研究。
英文摘要：
We consider parallel simulations for asynchronous systems employing L processing elements that are arranged on a ring. Processors communicate only among the nearest neighbors and advance their local simulated time only if it is guaranteed that this does not violate causality. In simulations with no constraints, in the infinite L-limit the utilization scales (Korniss et al, PRL 84, 2000); but, the width of the virtual time horizon diverges (i.e., the measurement phase of the algorithm does not scale). In this work, we introduce a moving window global constraint, which modifies the algorithm so that the measurement phase scales as well. We present results of systematic studies in which the system size (i.e., L and the volume load per processor) as well as the constraint are varied. The constraint eliminates the extreme fluctuations in the virtual time horizon, provides a bound on its width, and controls the average progress rate. The width of the window constraint can serve as a tuning parameter that, for a given volume load per processor, could be adjusted to optimize the utilization so as to maximize the efficiency. This result may find numerous applications in modeling the evolution of general spatially extended short-range interacting systems with asynchronous dynamics, including dynamic Monte Carlo studies.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
