A Hypergraph Model for Fault-Tolerant VLSI Processor Arrays
暂无分享,去创建一个
[1] J. Lang. On the design of a special-purpose digital control processor , 1984 .
[2] Arnold L. Rosenberg,et al. Cost Trade-offs in Graph Embeddings, with Applications , 1983, JACM.
[3] Chak-Kuen Wong,et al. Minimum K-hamiltonian graphs , 1984, J. Graph Theory.
[4] J. Greene,et al. Area and Delay Penalties in Restructurable Wafer-Scale Arrays , 1983 .
[5] H. T. Kung,et al. Wafer-scale integration and two-level pipelined implementations of systolic arrays , 1984, J. Parallel Distributed Comput..
[6] Kai Hwang,et al. VLSI architectures for feature extraction and pattern classification , 1983, Comput. Vis. Graph. Image Process..
[7] Frank Thomson Leighton,et al. Wafer-Scale Integration of Systolic Arrays , 1985, IEEE Trans. Computers.
[8] Lawrence Snyder,et al. Introduction to the configurable, highly parallel computer , 1982, Computer.
[9] Abbas El Gamal,et al. Configuration of VLSI Arrays in the Presence of Defects , 1984, JACM.
[10] John P. Hayes,et al. A Graph Model for Fault-Tolerant Computing Systems , 1976, IEEE Transactions on Computers.
[11] Kai Hwang,et al. Partitioned Matrix Algorithms for VLSI Arithmetic Systems , 1982, IEEE Transactions on Computers.
[12] Frank Thomson Leighton,et al. A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..
[13] Frank Thomson Leighton,et al. Wafer-scale integration of systolic arrays , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).