FSSP algorithms for 2D rectangular arrays. Recent developments

DOI10.1007/978-3-319-73216-9_2MaRDI QIDQ5112162zbMATH OpenOpenAlexFDO

Authors Hiroshi Umeo

Publication date 28 May 2020

Published in Reversibility and Universality (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-73216-9_2

Mathematics Subject Classification ID

Distributed systems (68M14) Cellular automata (computational aspects) (68Q80) Analysis of algorithms (68W40)

Recommendations

• Smaller-state implementations of 2D FSSP algorithms. Recent developments
• Time-optimum smaller-state synchronizers for cellular automata
• Firing squad synchronization algorithms for two-dimensional cellular automata
• How to synchronize cellular automata -- recent developments
• Synchronizing square arrays in optimum-time

Cites work

• A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays
• A generalized firing squad problem
• A new time-optimum synchronization algorithm for rectangle arrays
• A seven-state time-optimum square synchronizer
• An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
• scientific article; zbMATH DE number 3305051 (Why is no real title available?)
• Synchronizing square arrays in optimum-time
• Two- and three-dimensional firing-squad synchronization problems

Cited in

(6)

• A developing approach of the space-based SIFP using rectangular algorithm
• Smaller-state implementations of 2D FSSP algorithms. Recent developments
• A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\)
• Time-optimum smaller-state synchronizers for cellular automata
• Recent developments in constructing square synchronizers
• How to synchronize cellular automata -- recent developments

This page was built for publication: FSSP algorithms for 2D rectangular arrays. Recent developments

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