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

1976

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.
1976
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
Cellular
Synchronization
File in questo prodotto:
File Dimensione Formato  
prod_422616-doc_150300.pdf

solo utenti autorizzati

Descrizione: Cellular automata synchronization
Tipologia: Versione Editoriale (PDF)
Dimensione 1.46 MB
Formato Adobe PDF
1.46 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/383149
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 20
  • ???jsp.display-item.citation.isi??? ND
social impact