Catastrophic Faults in Reconfigurable Systolic Linear Arrays
暂无分享,去创建一个
[1] L. W. Shapiro,et al. A Catalan triangle , 1976, Discret. Math..
[2] Amiyaranjan Nayak. On reconfigurability of some regular architectures , 1991 .
[3] Nicola Santoro,et al. Bounds on performance of VLSI processor arrays , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.
[4] Dhiraj K. Pradhan,et al. Fault-tolerant computing : theory and techniques , 1986 .
[5] Patrice Quinton,et al. Systolic algorithms and architectures , 1987 .
[6] Hee Yong Youn,et al. A Highly Efficient Design for Reconfiguring the Processor Array in VLSI , 1988, ICPP.
[7] Prithviraj Banerjee,et al. A Fault Tolerant Massively Parallel Processing Architecture , 1987, J. Parallel Distributed Comput..
[8] W. Kent Fuchs,et al. Efficient Spare Allocation for Reconfigurable Arrays , 1987 .
[9] Frank Thomson Leighton,et al. Wafer-Scale Integration of Systolic Arrays , 1985, IEEE Trans. Computers.
[10] Yves Robert,et al. A Systolic Array for the Longest Common Subsequence Problem , 1985, Inf. Process. Lett..
[11] John P. Hayes,et al. On Designing and Reconfiguring k-Fault-Tolerant Tree Architectures , 1990, IEEE Trans. Computers.
[12] Nicola Santoro,et al. Fault-intolerance of reconfigurable systolic arrays , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.
[13] Richard Cole,et al. Multi-scale self-simulation: a technique for reconfiguring arrays with faults , 1993, STOC '93.
[14] H. T. Kung. Why systolic architectures? , 1982, Computer.
[15] R. Sarnath,et al. Proceedings of the International Conference on Parallel Processing , 1992 .
[16] Sy-yen Kuo,et al. Efficient Spare Allocation for Reconfigurable Arrays , 1987, IEEE Design & Test of Computers.
[17] Geppino Pucci,et al. Counting the Number of Fault Patterns in Redundant VLSI Arrays , 1994, Inf. Process. Lett..
[18] Prithviraj Banerjee,et al. Reconfiguration strategies in VLSI processor arrays , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.
[19] E. Reingold,et al. Combinatorial Algorithms: Theory and Practice , 1977 .
[20] Jehoshua Bruck,et al. Efficient Algorithms for Reconfiguration in VLSI/WSI Arrays , 1990, IEEE Trans. Computers.
[21] Mariagiovanna Sami,et al. Fault Tolerance Techniques for Array Structures Used in Supercomputing , 1986, Computer.
[22] H. T. Kung,et al. Fault-Tolerant VLSI Systolic Arrays and Two-Level Pipelining , 1983, Optics & Photonics.
[23] Bruce M. Maggs,et al. Reconfiguring Arrays with Faults Part I: Worst-Case Faults , 1997, SIAM J. Comput..
[24] José A. B. Fortes,et al. A taxonomy of reconfiguration techniques for fault-tolerant processor arrays , 1990, Computer.
[25] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[26] John P. Hayes,et al. Designing Fault-Tolerant System Using Automorphisms , 1991, J. Parallel Distributed Comput..
[27] Elena Barcucci,et al. Some more properties of Catalan numbers , 1992, Discret. Math..
[28] D. G. Rogers,et al. Pascal triangles, Catalan numbers and renewal arrays , 1978, Discret. Math..
[29] J.A. Abraham,et al. Fault and error models for VLSI , 1986, Proceedings of the IEEE.
[30] Yen-Chun Lin. New Systolic Arrays for the Longest Common Subsequence Problem , 1994, Parallel Comput..
[31] Mariagiovanna Sami,et al. Reconfigurable architectures for VLSI processing arrays , 1983, Proceedings of the IEEE.