A Note on Synchronization Steps in Firing Squad Synchronization Problem
The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In this paper, we propose two synchronization algorithms and their implementations, each having O(n2) and O(2n) synchronization steps for n cells, respectively.
cellular automaton firing squad synchronization problem
Akira Nomura Jean-Baptiste Yun(e)s Hiroshi Umeo
Univ. of Osaka Electro-Communication, Neyagawa-shi, Hatsu-cho, 18-8, 572-8530, Osaka, Japan LIAFA - Universite Paris 7 Denis Diderot, 175, rue du chevaleret, 75013 Paris, France
国际会议
黄山
英文
300-301
2010-05-28(万方平台首次上网日期,不代表论文的发表时间)