PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Romani F. Cellular automata synchronization. In: Information Science, (10) pp. 299 - 318. American Elsevier Publishing Company, 1976.
 
 
Abstract
(English)
This first part of this paper delas 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.
Subject


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional