Systematic Design of 3-Dimensional Fixed-Size Array Processors
by N.A. Likhoded, A.A. Tiountchik
Abstract:
A formalized method for a space-time mapping of algorithms onto three-dimensional fixed-size array processors without long interconnections is proposed. Initial algorithms are represented by dependence graphs which are constructed on the basis of recurrence equations. Some special forms of partitioning and spatial mapping of the graph models are considered to provide within the framework of locally parallel globally sequential strategy of partitioning both fixed size of the arrays and the locality of interconnections between processor elements. Conflictfree scheduling of the model is developed. Minimizing of the time requirements is considered. The parameters of scheduling providing the minimization are found.
Keywords: theory
Source:
N.A. Likhoded, A.A. Tiountchik, Systematic Design of 3-Dimensional Fixed-Size Array Processors. In V. Malyshkin (ed.),
Parallel Computing Technologies: Proceedings of the 4th International Conference,
Lect. Notes in Comp. Sci., Vol. 1277, Springer, 1997, pp. 60-69
