In extending the Firing Squad Synchronization problem to the case of tree connected networks and applying the controlled synchronization of linear arrays, we obtain the optimal time for trees with a bounded number of nodes. We also investigate methods for synchronizing general trees and show how to apply them to networks arbitrarily connected.

On the Fast Synchronization of Tree Connected Networks

ROMANI, FRANCESCO
1977

Abstract

In extending the Firing Squad Synchronization problem to the case of tree connected networks and applying the controlled synchronization of linear arrays, we obtain the optimal time for trees with a bounded number of nodes. We also investigate methods for synchronizing general trees and show how to apply them to networks arbitrarily connected.
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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11568/1737
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 8
social impact