A reconfiguration algorithm for delay minimization in VLSI/WSI array processors
暂无分享,去创建一个
[1] H. T. Kung. Why systolic architectures? , 1982, Computer.
[2] R.C. Aubusson,et al. Wafer-scale integration-a fault-tolerant procedure , 1978, IEEE Journal of Solid-State Circuits.
[3] Arnold L. Rosenberg,et al. The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors , 1983, IEEE Transactions on Computers.
[4] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[5] Cauligi S. Raghavendra,et al. Gracefully Degradable Processor Arrays , 1985, IEEE Transactions on Computers.
[6] R. Prim. Shortest connection networks and some generalizations , 1957 .
[7] Shimon Even,et al. Graph Algorithms , 1979 .
[8] Mariagiovanna Sami,et al. Fault Tolerance Techniques for Array Structures Used in Supercomputing , 1986, Computer.
[9] Lawrence Snyder,et al. Introduction to the configurable, highly parallel computer , 1982, Computer.
[10] Frank Thomson Leighton,et al. Wafer-Scale Integration of Systolic Arrays , 1985, IEEE Trans. Computers.
[11] H. T. Kung,et al. Fault-Tolerance and Two-Level Pipelining in VLSI Systolic Arrays , 1983 .
[12] David W. L. Yen,et al. Systolic Processing and an Implementation for Signal and Image Processing , 1982, IEEE Transactions on Computers.
[13] H. T. Kung,et al. Using warp as a supercomputer in signal processing , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.
[14] Algirdas Avizienis,et al. Fault-Tolerant Design for VLSI: Effect of Interconnect Requirements on Yield Improvement of VLSI Designs , 1982, IEEE Transactions on Computers.
[15] R. Heckelman,et al. Self-testing VLSI , 1981, 1981 IEEE International Solid-State Circuits Conference. Digest of Technical Papers.
[16] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.