An Implementation of an Optimum-Time Firing Squad Synchronization Algorithm on Two-Dimensional Arrays

摘要：

In the present paper, we propose a new implementation of an optimum-time synchronization algorithm that can synchronize any rectangle array of size m×n with a general at one corner in m + n + max(m, n) - 3 steps.

关键词： cellular automata firing squad synchronization problem

作者: Kinuo Nishide Takuya Yamawaki Hiroshi Umeo

作者单位: Univ. of Osaka Electro-Communication,Neyagawa-shi, Hatsu-cho, 18-8,572-8530, Osaka, Japan Univ. of Osaka Electro-Communication Neyagawa-shi, Hatsu-cho, 18-8,572-8530, Osaka, Japan

会议类型: 国际会议

会议名称: The Third International Joint Conference on Computational Science and Optimization(第三届计算科学与优化国际大会 CSO 2010)

会议地点: 黄山

会议语种:英文

页码: 170-171

在线出版日期: 2010-05-28（万方平台首次上网日期，不代表论文的发表时间）