异步蜂窝阵列的高效并行仿真
Efficient Parallel Simulations of Asynchronous Cellular Arrays
摘要：
提出了一类异步蜂窝阵列的定义。这种迭代的一个例子是单元迭代的独立泊松到达。Glauber的连续时间公式中的伊辛模型属于这一类。还提出了有效的并行算法来模拟这些异步蜂窝阵列。在算法中，一个或多个小区被分配给一个处理单元（PE），不同PE的本地时间可以不同。虽然Metropolis、Rosenbluth、Rosenbluth、Teller和Teller的标准串行算法可以模拟这样的阵列，但通常认为它没有有效的并行算法。然而，所提出的并行算法与这种信念相矛盾，证明是有效的，并能够执行相同的任务，作为标准算法。新算法的实验结果是令人鼓舞的：在共享存储器MIMD总线计算机上使用25个PE的加速比大于16，在SIMD计算机上使用2**14个PE的加速比大于1900。Bortz，Kalos和Lebowitz的算法可以被合并到所提出的并行算法中，进一步有助于加速。[In本文提出了更新局部时间最小点的并行模拟方案。现在这个计划越来越受欢迎。1987年《复杂系统》出版物的许多印刷错误在这里得到纠正。B. L.]
英文摘要：
A definition for a class of asynchronous cellular arrays is proposed. An example of such asynchrony would be independent Poisson arrivals of cell iterations. The Ising model in the continuous time formulation of Glauber falls into this class. Also proposed are efficient parallel algorithms for simulating these asynchronous cellular arrays. In the algorithms, one or several cells are assigned to a processing element (PE), local times for different PEs can be different. Although the standard serial algorithm by Metropolis, Rosenbluth, Rosenbluth, Teller, and Teller can simulate such arrays, it is usually believed to be without an efficient parallel counterpart. However, the proposed parallel algorithms contradict this belief proving to be both efficient and able to perform the same task as the standard algorithm. The results of experiments with the new algorithms are encouraging: the speed-up is greater than 16 using 25 PEs on a shared memory MIMD bus computer, and greater than 1900 using 2**14 PEs on a SIMD computer. The algorithm by Bortz, Kalos, and Lebowitz can be incorporated in the proposed parallel algorithms, further contributing to speed-up. [In this paper I invented the update-cites-of-local-time-minima parallel simulation scheme. Now the scheme is becoming popular. Many misprints of the original 1987 Complex Systems publication are corrected here.-B.L.]
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
