ABSTRACT
The development of synthesis techniques for dynamic problems consti tutes an entirely new chapter in regular array design. Researchers in the field have so far avoided consideration of dynamic problems, mainly on the belief that dynamic dependencies and the static topology of regular arrays cannot be reconciled. However, examples of ad hoc regular arrays for prob lems which may be considered as dynamic exist in the literature (one of these problems, that of Gaussian elimination with pivoting, will be considered in Chapter 5). Therefore, it appears that regular array design is feasible at least for restricted classes of dynamic problems.
