A Programming Notation for Locally Synchronized Algorithms
Armin Bernd Cremers, Thomas Nathaniel Hibbard · Defense Technical Information Center (DTIC) · 1985
A locally synchronized algorithm defines a parallel computation for a locally interconnected static structure of asynchronous processing elements. The computation is restricted to observe a data-flow principle. A programming notation is presented in which to specify locally synchronized algorithms. The notation is based on the concept of applicative state transition system extended by certain delay and force mechanisms. The underlying theory is surveyed, and the development of a locally synchronized algorithm is illustrated by a nontrivial example. (Author)