Presentation 2012-10-31
Synchronizing Multi-Dimensional Cellular Automata in Optimum-Time
Hiroshi UMEO, Kinuo NISHIDE, Keisuke KUBO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In the present paper, we propose a simple recursive-halving based optimum-time synchronization algorithm that can synchronize any rectangle arrays of size m×n with a general at one corner in m+n+max(m,n)-3 steps. The algorithm is a natural expansion of the well-known FSSP algorithms proposed by Balzer [1967], Gerken [1987], and Waksman [1966] and it can be easily expanded to three-dimensional arrays, even to multi-dimensional arrays with a general at any position of the array. The algorithm proposed is isotropic concerning the side-lengths of multi-dimensional arrays and its algorithmic correctness is transparent and easily verified.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) firing squad synchronization problem / FSSP / cellular automata
Paper # COMP2012-35
Date of Issue

Conference Information
Committee COMP
Conference Date 2012/10/24(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 Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Synchronizing Multi-Dimensional Cellular Automata in Optimum-Time
Sub Title (in English)
Keyword(1) firing squad synchronization problem
Keyword(2) FSSP
Keyword(3) cellular automata
1st Author's Name Hiroshi UMEO
1st Author's Affiliation Faculty of Engineering, University of Osaka Electro-Communication()
2nd Author's Name Kinuo NISHIDE
2nd Author's Affiliation Faculty of Engineering, University of Osaka Electro-Communication
3rd Author's Name Keisuke KUBO
3rd Author's Affiliation Faculty of Engineering, University of Osaka Electro-Communication
Date 2012-10-31
Paper # COMP2012-35
Volume (vol) vol.112
Number (no) 272
Page pp.pp.-
#Pages 6
Date of Issue