Presentation 2013-11-06
Synchronzing 2D Arrays in Optimum-Time
Hiroshi UMEO, Keisuke KUBO, Yusuke TAKAHASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The firing squad synchronization problem (FSSP) has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms has been proposed for not only one-dimensional but two-dimensional arrays. In the present paper, we propose a new recursive-halving based optimum-time synchronization algorithm that can synchronize any rectangle two-dimensional (2D) arrays of size m×n with a general at one corner in m+n+max(m,n)-3 steps.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Cellular automaton / FSSP
Paper # CAS2013-57,MSS2013-36
Date of Issue

Conference Information
Committee MSS
Conference Date 2013/10/30(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 Mathematical Systems Science and its applications(MSS)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Synchronzing 2D Arrays in Optimum-Time
Sub Title (in English)
Keyword(1) Cellular automaton
Keyword(2) FSSP
1st Author's Name Hiroshi UMEO
1st Author's Affiliation Faculty of Engineering, University of Osaka Electro-Communication()
2nd Author's Name Keisuke KUBO
2nd Author's Affiliation Faculty of Engineering, University of Osaka Electro-Communication
3rd Author's Name Yusuke TAKAHASHI
3rd Author's Affiliation Faculty of Engineering, University of Osaka Electro-Communication
Date 2013-11-06
Paper # CAS2013-57,MSS2013-36
Volume (vol) vol.113
Number (no) 279
Page pp.pp.-
#Pages 6
Date of Issue