Abstract

We propose a number-conserving firing squad synchronization algorithm, which is nearly a time-optimum solution to the firing squad synchronization problem (FSSP). The algorithm can be implemented on a number-conserving cellular automaton. In the number-conserving cellular automata (NC-CA), any state of cells is represented by a single non-negative integer and total summed number of states in any configuration is conserved throughout its operations. The NC-CA can be thought as a model of the physical conservation law of mass or energy. Our synchronization algorithm has multiple firing states and can synchronize any array of length n in 2n - 1 steps.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.