Abstract
Synchronization of large-scale networks is an important and fundamental computing primitive in parallel and distributed systems. The synchronization in cellular automata, known as 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 not only for one-dimensional but also for two-dimensional, even multi-dimensional cellular arrays. In the present paper, we construct an overview of the study of the FSSP algorithms developed so far, focusing on time-optimum smaller-state solutions to the FSSP.
Cite
CITATION STYLE
Umeo, H. (2014). Time-optimum smaller-state synchronizers for cellular automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8808, 129–145. https://doi.org/10.1007/978-3-319-13350-8_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
