Synchronization of 1-way connected processors
From MaRDI portal
Recommendations
Cites work
- A linear speed-up theorem for cellular automata
- 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
- scientific article; zbMATH DE number 3237733 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- The firing squad synchronization problem for two-dimensional arrays
- Two- and three-dimensional firing-squad synchronization problems
- Variations of the firing squad problem and applications
Cited in
(6)- A compositional approach to synchronize two-dimensional networks of processors
- Different time solutions for the firing squad synchronization problem on basic grid networks
- scientific article; zbMATH DE number 1192313 (Why is no real title available?)
- scientific article; zbMATH DE number 1869612 (Why is no real title available?)
- scientific article; zbMATH DE number 2119713 (Why is no real title available?)
- The wake up and report problem is time-equivalent to the firing squad synchronization problem
This page was built for publication: Synchronization of 1-way connected processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055943)
