The first part of this paper deals with the Firing Squad Synchronization problem extended to networks however connected. A new class of configurations called ''flower graphs'' is presented whose synchronization is useful to reduce synchronization time for any graph. The second part investigates the lower bounds for synchronization time from a theoretical point of view. Results are obtained that are valid for several classes of graphs.
Cellular Automata Synchronization
ROMANI, FRANCESCO
1976-01-01
Abstract
The first part of this paper deals with the Firing Squad Synchronization problem extended to networks however connected. A new class of configurations called ''flower graphs'' is presented whose synchronization is useful to reduce synchronization time for any graph. The second part investigates the lower bounds for synchronization time from a theoretical point of view. Results are obtained that are valid for several classes of graphs.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
