On Designing and Reconfiguring k-Fault-Tolerant Tree Architectures
暂无分享,去创建一个
[1] S. Toida,et al. An optimal 2-FT realization of binary symmetric hierarchical tree systems , 1982, Networks.
[2] Israel Koren. Comments on "The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors" , 1986, IEEE Trans. Computers.
[3] Ellis Horowitz,et al. The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSI , 1981, IEEE Transactions on Computers.
[4] David A. Patterson,et al. X-Tree: A tree structured multi-processor computer architecture , 1978, ISCA '78.
[5] Jon Louis Bentley,et al. Multidimensional Binary Search Trees in Database Applications , 1979, IEEE Transactions on Software Engineering.
[6] John P. Hayes,et al. Distributed Recovery in Fault-Tolerant Multiprocessor Networks , 1986, IEEE Transactions on Computers.
[7] John P. Hayes,et al. A Graph Model for Fault-Tolerant Computing Systems , 1976, IEEE Transactions on Computers.
[8] C. C. Lau,et al. A distributed multiprocessor traffic control system , 1978, COMPSAC.
[9] Milos D. Ercegovac,et al. Fault Tolerance in Binary Tree Architectures , 1984, IEEE Transactions on Computers.
[10] W. Kent Fuchs,et al. Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance , 1987, IEEE Transactions on Computers.
[11] Chi Leung Kwan. Dynamically reconfigurable optimal fault-tolerant structures of hierarchical tree systems , 1981 .
[12] Kenneth P. Bogart,et al. Introductory Combinatorics , 1977 .