A model is defined in which questions concerning delay bounded asynchronous parallel systems may be investigated. Persistence and determinacy are introduced for this model. These two conditions are shown to be sufficient to guarantee that a synchronous execution policy can be relaxed to an asynchronous execution policy with no change to the result of the computation. In addition, the asynchronous execution time is only (D+1) times the synchronous execution time, where D is the delay bound. A wide class of recognition problems is identified which can be solved by linear asynchronous structures. Also, it is shown that synchronization problems, similar to the "firing squad synchronization problem," cannot be solved by delay bounded asynchronous systems.
[1]
E. F. Moore.
The firing squad synchronization problem
,
1964
.
[2]
Alvy Ray Smith,et al.
Real-Time Language Recognition by One-Dimensional Cellular Automata
,
1972,
J. Comput. Syst. Sci..
[3]
A. Church,et al.
Some properties of conversion
,
1936
.
[4]
Robert M. Keller,et al.
A Fundamental Tehoerem of Asynchronous Parallel Computation
,
1974,
Sagamore Computer Conference.
[5]
Patrick C. Fischer,et al.
Generation of Primes by a One-Dimensional Real-Time Iterative Array
,
1965,
JACM.