Presentation 2008-08-01
A Generalized Firing Squad Synchronization Algorithm for Square Arrays
Keisuke KUBO, Hiroshi UMEO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The firing squad synchronization problem on cellular automata has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we give some algorithms can synchronize any two-dimensional array of size n×n in 2n-2 steps.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Syncronization algorithm / Cellular automata
Paper # NLP2008-33
Date of Issue

Conference Information
Committee NLP
Conference Date 2008/7/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Generalized Firing Squad Synchronization Algorithm for Square Arrays
Sub Title (in English)
Keyword(1) Syncronization algorithm
Keyword(2) Cellular automata
1st Author's Name Keisuke KUBO
1st Author's Affiliation Univ. of Osaka Electro-Communication, Graduate School of Engineering Faculty of Information Science and Technology, Department of Informatics()
2nd Author's Name Hiroshi UMEO
2nd Author's Affiliation Univ. of Osaka Electro-Communication, Graduate School of Engineering Faculty of Information Science and Technology, Department of Informatics
Date 2008-08-01
Paper # NLP2008-33
Volume (vol) vol.108
Number (no) 175
Page pp.pp.-
#Pages 6
Date of Issue