2011 Fiscal Year Final Research Report
Developments of Smallest Synchronization Protocols and Its Application to Multi-Dimensional Cellular Arrays
Project/Area Number |
21500023
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Single-year Grants |
Section | 一般 |
Research Field |
Fundamental theory of informatics
|
Research Institution | Osaka Electro-Communication University |
Principal Investigator |
UMEO Hiroshi 大阪電気通信大学, 情報通信工学部, 教授 (80132356)
|
Project Period (FY) |
2009 – 2011
|
Keywords | オートマトン理論・形式言語理論 / アルゴリズム理論 / セルオートマトン / 一斉射撃問題 |
Research Abstract |
We study a firing squad synchronization problem(FSSP) that gives a finite-state protocol for synchronizing cellular automata(CA). In this research project, we made an investigation into smaller FSSP solutions not only for one-dimensional(1D) but multi-dimensional CAs. We present a class of smallest 4-state partial solutions for 1D the CAs. It is shown that there exists a 7-state square synchronizer for 2D square arrays, which is a smallest solution for square arrays, known at present. We also show that there exists a nine-state FSSP solution for 2D rectangular arrays. In the last, we have proposed a new class of optimum-time multi-dimensional FSSP algorithms based on recursive-halving marking.
|
Research Products
(27 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Book] セルオートマトン2011
Author(s)
梅尾, F. Peper, 足立, 磯川, 今井, 小松崎, J. Lee
Total Pages
250
Publisher
共立出版
-
-
-
-