| Presentation | 2003/10/14 A Design of Time-optimum One-way Recursive Firing Squad Synchronization Algorithms for One-dimensional Cellular Arrays Masaya HISAOKA, Katsunori SHIBASAKI, Hayato YANASE, Hiroshi UMEO, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The famous firing squad synchronization problem is stated as follows: Given a one-dimensional array of n identical cellular automata, including a general at the left end which is activated at time t = 0, we want to design the automata so that, at some future time, all the cells will simultaneously and, for the first time, enter a special firing state. The problem was originally proposed by J. Myhill in 1957 to synchronize all parts of a self-reproducing machine. In this paper, we propose a design scheme for one-way recursive optimum-time firing squad synchronization algorithms for one-dimensional celluler arrays and develop a 26-state optimum-time synchronization algorithm having one-way recursiveness. In addition, we also study a class of synchronization algorithms with one-way recursiveness operating in linasr-time. A 39-state implementation for (3n-3)-step one-way recursive synchronization algorithm will be given. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Cellular Automaton / Firing Squad Synchronization Problem / Generalization of Firing Squad Synchronization Algorithm |
| Paper # | NLP2003-97 |
| Date of Issue |
| Conference Information | |
| Committee | NLP |
|---|---|
| Conference Date | 2003/10/14(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 Design of Time-optimum One-way Recursive Firing Squad Synchronization Algorithms for One-dimensional Cellular Arrays |
| Sub Title (in English) | |
| Keyword(1) | Cellular Automaton |
| Keyword(2) | Firing Squad Synchronization Problem |
| Keyword(3) | Generalization of Firing Squad Synchronization Algorithm |
| 1st Author's Name | Masaya HISAOKA |
| 1st Author's Affiliation | Osaka Electro-Communication Univ., Graduate School of Engineering() |
| 2nd Author's Name | Katsunori SHIBASAKI |
| 2nd Author's Affiliation | Osaka Electro-Communication Univ., Graduate School of Engineering |
| 3rd Author's Name | Hayato YANASE |
| 3rd Author's Affiliation | Osaka Electro-Communication Univ., Faculty of Information Science and Technology |
| 4th Author's Name | Hiroshi UMEO |
| 4th Author's Affiliation | Osaka Electro-Communication Univ., Graduate School of Engineering : Osaka Electro-Communication Univ., Faculty of Information Science and Technology |
| Date | 2003/10/14 |
| Paper # | NLP2003-97 |
| Volume (vol) | vol.103 |
| Number (no) | 375 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |