A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays

DOI10.1016/J.CNSNS.2014.07.031MaRDI QIDQ907212zbMATH OpenOpenAlexFDO

Authors Hiroshi Umeo, Keisuke Kubo, Kinuo Nishide

Publication date 25 January 2016

Published in Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cnsns.2014.07.031

zbMATH Keywords

cellular automatonfiring squad synchronization problemmulti-dimensional FSSP algorithm

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• A simple optimum-time FSSP algorithm for multi-dimensional cellular automata
• An optimum-time square synchronization algorithm. One-sided recursive-halving marking based
• An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
• Unconventional Computation
• A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based

Cites work

• scientific article; zbMATH DE number 5117093 (Why is no real title available?)
• scientific article; zbMATH DE number 2163014 (Why is no real title available?)
• scientific article; zbMATH DE number 3305051 (Why is no real title available?)
• A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
• A new time-optimum synchronization algorithm for rectangle arrays
• A six-state minimal time solution to the Firing squad synchronization problem
• An 8-state minimal time solution to the firing squad synchronization problem
• An optimum solution to the firing squad synchronization problem
• Recent developments in firing squad synchronization algorithms for two-dimensional cellular automata and their state-efficient implementations
• Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
• Two- and three-dimensional firing-squad synchronization problems
• Unconventional Computation

Cited in

(6)

• Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays
• A simple optimum-time FSSP algorithm for multi-dimensional cellular automata
• scientific article; zbMATH DE number 7385088 (Why is no real title available?)
• Preface to the special issue NUMTA 2013
• FSSP algorithms for 2D rectangular arrays. Recent developments
• A new reconstruction and the first implementation of Goto's FSSP algorithm

This page was built for publication: A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q907212)