Paper Info
Title
A comparative investigation into optimum-time synchronization protocols for a large scale of one dimensional cellular automata
Abstract
The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we examine the state transition rule sets for the famous firing squad synchronization algorithms that give a finite-state protocol for synchronizing large-scale cellular automata. We show that the first transition rule set designed by Waksman [18] includes fundamental errors which cause unsuccessful firings and that ninety-three percent of the rules are redundant. In addition, the transition rule sets reported by Balzer [1], Gerken [2] and Mazoyer [6] are found to include several redundant rules. We also present herein a survey and a comparison of the quantitative aspects of the optimumtime synchronization algorithms developed thus far for one-dimensional cellular arrays.
Year
DOI
Venue
2003
10.1007/3-540-37619-4_18
ISPA
Keywords
Field
DocType
optimum-time synchronization protocol,optimumtime synchronization algorithm,synchronization algorithm,large scale,comparative investigation,present herein,famous firing squad synchronization,state transition rule set,firing squad synchronization problem,redundant rule,dimensional cellular automaton,transition rule,large-scale cellular automaton,one-dimensional cellular array,cellular automata,state transition
Cellular automaton,Synchronization,Computer science,Synchronizing,Time synchronization,Firing squad synchronization problem,Algorithm,Finite-state machine,Redundancy (engineering),Selection rule
Conference
ISBN
Citations 
PageRank 
3-540-40523-2
0
0.34
References 
Authors
8
3
Name
Order
Citations
PageRank
Hiroshi Umeo136153.61
Masaya Hisaoka2724.26
Takashi Sogabe3252.45