Partitioning: An Essential Step in Mapping Algorithms Into Systolic Array Processors
暂无分享,去创建一个
[1] Dan I. Moldovan,et al. Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays , 1986, IEEE Transactions on Computers.
[2] S. Kung,et al. VLSI Array processors , 1985, IEEE ASSP Magazine.
[3] King-Sun Fu,et al. Algorithm partition for a fixed-size VLSI architecture using space-time domain expansion , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).
[4] 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.
[5] Mateo Valero,et al. Computing size-independent matrix problems on systolic array processors , 1986, ISCA '86.
[6] H. T. Kung,et al. Wafer-scale integration and two-level pipelined implementations of systolic arrays , 1984, J. Parallel Distributed Comput..
[7] H. T. Kung,et al. Systolic Arrays for (VLSI). , 1978 .
[8] H. J. Whitehouse,et al. Signal processing with systolic arrays , 1981 .
[9] H. T. Kung. Why systolic architectures? , 1982, Computer.
[10] Lennart Johnsson. Computational Arrays for Band Matrix Equations , 1981 .
[11] Mateo Valero,et al. Solving Matrix Problems with No Size Restriction on a Systolic Array Processor , 1986, International Conference on Parallel Processing.
[12] Henry Y. H. Chuang,et al. A Versatile Systolic Array for Matrix Computations , 1985, ISCA.