论文信息 - Calculus of space-optimal mappings of systolic algorithms on processor arrays

Calculus of space-optimal mappings of systolic algorithms on processor arrays

We present a method to find mappings of systolic algorithms that use the minimal number of processors. This method is based on geometrical interpretations on the convex polyhedra in Zn. We use our results to derive two space-optimal mappings for the Gaussian elimination algorithm.

[1] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.

[2] H. T. Kung,et al. Systolic Arrays for (VLSI). , 1978 .

[3] H. T. Kung. Why systolic architectures? , 1982, Computer.

[4] P. Quinton. Automatic synthesis of systolic arrays from uniform recurrent equations , 1984, ISCA 1984.

[5] Benjamin W. Wah,et al. Systematic approaches to the design of algorithmically specified systolic arrays , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[6] Dan I. Moldovan,et al. ADVIS: A Software Package for the Design of Systolic Arrays , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7] T. J. Fountain,et al. Processor Arrays: Architecture and Applications , 1987 .

[8] Sanjay V. Rajopadhye,et al. Systolic Array Synthesis by Static Analysis of Program Dependencies , 1987, PARLE.

[9] Sun-Yuan Kung,et al. Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems , 1987, IEEE Transactions on Computers.

[10] Patrice Quinton,et al. Systolic algorithms and architectures , 1987 .

[11] Christian Lengauer,et al. An Implemented Method for Incremmental Systolic Design , 1987, PARLE.

[12] Ph. Clauss,et al. Synthesis of process arrays , 1989 .

[13] P. Clauss. Synthèse d'algorithmes systoliques et implantation optimale en place sur réseaux de processeurs synchrones , 1990 .