A new time-optimum synchronization algorithm for rectangle arrays
From MaRDI portal
Publication:3603568
zbMATH Open1158.68027MaRDI QIDQ3603568FDOQ3603568
Authors: Hiroki Uchino, Hiroshi Umeo 
Publication date: 17 February 2009
Full work available at URL: http://iospress.metapress.com/content/7h4w3uh7650723g3/fulltext.html
Recommendations
- An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
- Machines, Computations, and Universality
- A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
- Unconventional Computation
- Synchronizing square arrays in optimum-time
Cited In (10)
- Machines, Computations, and Universality
- An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
- An optimum-time square synchronization algorithm. One-sided recursive-halving marking based
- A Comparative Study of Optimum-Time Synchronization Algorithms for One-Dimensional Cellular Automata – A Survey –
- Unconventional Computation
- A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays
- FSSP algorithms for 2D rectangular arrays. Recent developments
- A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
- A seven-state time-optimum square synchronizer
- Synchronizing square arrays in optimum-time
This page was built for publication: A new time-optimum synchronization algorithm for rectangle arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603568)
