A Compositional Approach to Synchronize Two Dimensional Networks of Processors

¹ Department of Computer and Information Science, University of Pennsylvania, 200 South 33rd Street, Philadelphia, PA 19104-638, U.S.A.
² Dipartimento di Informatica ed Applicazioni, Università degli Studi di Salerno "Renato M. Capocelli", 84081 Baronissi (SA), Italy.

Received: 10 August 2000
Accepted: 16 February 2001

Abstract

The problem of synchronizing a network of identical processors that work synchronously at discrete steps is studied. Processors are arranged as an array of m rows and n columns and can exchange each other only one bit of information. We give algorithms which synchronize square arrays of (n × n) processors and give some general constructions to synchronize arrays of (m × n) processors. Algorithms are given to synchronize in time n², , and 2ⁿ a square array of (n × n) processors. Our approach is a modular description of synchronizing algorithms in terms of "fragments" of cellular automata that are called signals. Compositional rules to obtain new signals (and new synchronization times) starting from known ones are given for an (m × n) array. Using these compositional rules we construct synchronizations in any "feasible" linear time and in any time expressed by a polynomial with nonnegative coefficients.