Design methodology for systematic derivation of fault-tolerant array processors

A systematic approach for mapping of iterative algorithms into fault-tolerant processor arrays is presented. The initial description of the algorithms is Fortran-like nested loops, and the restrictions of the intermediate forms such as UREs are avoided. The principles of the coordinate method are used and regular or piecewise regular arrays can be derived. The allocation and the scheduling of the computations are specified by suitable interpretation of the functionality of each loop index. New approaches are proposed for facilitating fault/defect-tolerant array processor design during the mapping process by using idle processing elements.<<ETX>>

[1]  Patrice Quinton,et al.  The systematic design of systolic arrays , 1987 .

[2]  Thomas Kailath,et al.  Regular iterative algorithms and their implementation on processor arrays , 1988, Proc. IEEE.

[3]  Constantine D. Polychronopoulos,et al.  Parallel programming and compilers , 1988 .

[4]  Fabrizio Lombardi,et al.  Reconfiguration of VLSI arrays by covering , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Lothar Thiele,et al.  On the hierarchical design of VLSI processor arrays , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[6]  Dimitrios Soudris,et al.  Design methodology of mapping iterative algorithms on piecewise regular processor arrays , 1991, [1991] Proceedings, Advanced Computer Technology, Reliable Systems and Applications.

[7]  Leslie Lamport,et al.  The parallel execution of DO loops , 1974, CACM.

[8]  Dimitrios Soudris,et al.  Design methodology for direct mapping of iterative algorithms on array architectures , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[9]  S. Kung,et al.  VLSI Array processors , 1985, IEEE ASSP Magazine.