A Polynomial Time Algorithm for Reconfiguring Multiple-Track Models
暂无分享,去创建一个
[1] Jeffrey B. Lotspiech,et al. On Finding Non-Intersecting Straightline Connections of Grid Points to the Boundary , 1992, J. Algorithms.
[2] Fabrizio Lombardi,et al. Reconfiguration of VLSI arrays by covering , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[3] S. Y. Kung,et al. Yield enhancement for WSI array processors using two-and-half-track switches , 1990, 1990 Proceedings. International Conference on Wafer Scale Integration.
[4] Thomas Kailath,et al. New algorithms for reconfiguring VLSI/WSI arrays , 1991, J. VLSI Signal Process..
[5] Jehoshua Bruck,et al. How to Play Bowling in Parallel on the Grid , 1991, J. Algorithms.
[6] Sun-Yuan Kung,et al. Fault-Tolerant Array Processors Using Single-Track Switches , 1989, IEEE Trans. Computers.
[7] José A. B. Fortes,et al. The Full-Use-of-Suitable-Spares (FUSS) Approach to Hardware Reconfiguration for Fault-Tolerant Processor Arrays , 1990, IEEE Trans. Computers.
[8] Thomas Kailath,et al. Reconfiguring Processor Arrays Using Multiple-Track Models: The 3-Track-1-Spare-Approach , 1993, IEEE Trans. Computers.
[9] T. Kailath,et al. Some new algorithms for reconfiguring VLSI/WSI arrays , 1990, 1990 Proceedings. International Conference on Wafer Scale Integration.
[10] Jehoshua Bruck,et al. Efficient Algorithms for Reconfiguration in VLSI/WSI Arrays , 1990, IEEE Trans. Computers.
[11] Jack Jean. Fault-tolerant array processors using N-and-half-track switches , 1990, [1990] Proceedings of the International Conference on Application Specific Array Processors.