In this paper we study a classical firing squad synchronization problem on a model of fault-tolerant cellular automata that have possibly some defective cells. Several fault-tolerant time-efficient synchronization algorithms are developed based on a simple freezing-thawing technique. It is shown that, under some constraints on the distribution of defective cells, any cellular array of length n with p defective cell segments can be synchronized in 2n - 2 + p steps.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Hiroshi UMEO, "A Simple Design of Time-Efficient Firing Squad Synchronization Algorithms with Fault-Tolerance" in IEICE TRANSACTIONS on Information,
vol. E87-D, no. 3, pp. 733-739, March 2004, doi: .
Abstract: In this paper we study a classical firing squad synchronization problem on a model of fault-tolerant cellular automata that have possibly some defective cells. Several fault-tolerant time-efficient synchronization algorithms are developed based on a simple freezing-thawing technique. It is shown that, under some constraints on the distribution of defective cells, any cellular array of length n with p defective cell segments can be synchronized in 2n - 2 + p steps.
URL: https://global.ieice.org/en_transactions/information/10.1587/e87-d_3_733/_p
Copy
@ARTICLE{e87-d_3_733,
author={Hiroshi UMEO, },
journal={IEICE TRANSACTIONS on Information},
title={A Simple Design of Time-Efficient Firing Squad Synchronization Algorithms with Fault-Tolerance},
year={2004},
volume={E87-D},
number={3},
pages={733-739},
abstract={In this paper we study a classical firing squad synchronization problem on a model of fault-tolerant cellular automata that have possibly some defective cells. Several fault-tolerant time-efficient synchronization algorithms are developed based on a simple freezing-thawing technique. It is shown that, under some constraints on the distribution of defective cells, any cellular array of length n with p defective cell segments can be synchronized in 2n - 2 + p steps.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - A Simple Design of Time-Efficient Firing Squad Synchronization Algorithms with Fault-Tolerance
T2 - IEICE TRANSACTIONS on Information
SP - 733
EP - 739
AU - Hiroshi UMEO
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E87-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2004
AB - In this paper we study a classical firing squad synchronization problem on a model of fault-tolerant cellular automata that have possibly some defective cells. Several fault-tolerant time-efficient synchronization algorithms are developed based on a simple freezing-thawing technique. It is shown that, under some constraints on the distribution of defective cells, any cellular array of length n with p defective cell segments can be synchronized in 2n - 2 + p steps.
ER -