FSSP Algorithms for Square and Rectangular Arrays

Hiroshi Umeo ()
Additional contact information
Hiroshi Umeo: University of Osaka Electro-Communication

A chapter in Modeling, Simulation and Optimization of Complex Processes - HPSC 2012, 2014, pp 245-259 from Springer

Abstract: Abstract The synchronization in cellular automata has been known as firing squad synchronization problem (FSSP) since its development. The firing squad synchronization problem on cellular automata has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms has been proposed not only for one-dimensional arrays but also for two-dimensional arrays. In the present paper, we focus our attention to the two-dimensional array synchronizers that can synchronize any square/rectangle arrays and construct a survey on recent developments in their designs and implementations of optimum-time and non-optimum-time synchronization algorithms for two-dimensional arrays.

Keywords: Firing Squad Synchronization Problem (FSSP); FSSP Algorithm; Cellular Automata; Optimum-time Synchronization; Rectangle Array (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-09063-4_20

Ordering information: This item can be ordered from
http://www.springer.com/9783319090634

DOI: 10.1007/978-3-319-09063-4_20

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().