论文信息 - Systematic design of systolic arrays for computing multiple problem instances

Systematic design of systolic arrays for computing multiple problem instances

Abstract The one-to-one space-time mapping approach has been extended to mapping multiple problem instances onto a single systolic array. Compared with previous methods, the proposed approach significantly reduces the number of I/O pins on the chip as well as increases the throughput and the ratio of throughput over space.

C. N. Zhang

[1] Matthew T. O'Keefe,et al. A Comparative Study of Two Systematic Design Methodologies for Systolic Arrays , 1986, ICPP.

[2] Dan I. Moldovan,et al. Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays , 1986, IEEE Transactions on Computers.

[3] D.I. Moldovan,et al. On the design of algorithms for VLSI systolic arrays , 1983, Proceedings of the IEEE.

[4] Dan I. Moldovan,et al. Parallelism detection and transformation techniques useful for VLSI algorithms , 1985, J. Parallel Distributed Comput..

[5] Benjamin W. Wah,et al. The Design of Optimal Systolic Arrays , 1985, IEEE Transactions on Computers.

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