Design and Analysis of a Generalized Architecture for Reconfigurable m-ary Tree Structures
暂无分享,去创建一个
[1] Prithviraj Banerjee,et al. Reconfiguration Strategies for VLSI Processor Arrays and Trees Using a Modified Diogenes Approach , 1992, IEEE Trans. Computers.
[2] Mariagiovanna Sami,et al. Fault Tolerance Techniques for Array Structures Used in Supercomputing , 1986, Computer.
[3] Srinivas Sampalli,et al. A Reconfigurable Tree Architecture with Multistage Interconnection Network , 1990, IEEE Trans. Computers.
[4] John P. Hayes,et al. On Designing and Reconfiguring k-Fault-Tolerant Tree Architectures , 1990, IEEE Trans. Computers.
[5] Vinod K. Agarwal,et al. An Efficient Unsorted VLSI Dictionary Machine , 1985, IEEE Transactions on Computers.
[6] John P. Hayes,et al. A Graph Model for Fault-Tolerant Computing Systems , 1976, IEEE Transactions on Computers.
[7] Vinod K. Agarwal,et al. A Fault-Tolerant Modular Architecture for Binary Trees , 1986, IEEE Transactions on Computers.
[8] Salvatore J. Stolfo,et al. DADO: A Parallel Processor for Expert Systems , 1984 .
[9] Janak H. Patel. Performance of Processor-Memory Interconnections for Multiprocessors , 1981, IEEE Transactions on Computers.
[10] Arnold L. Rosenberg,et al. The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors , 1983, IEEE Transactions on Computers.
[11] David Elliot Shaw,et al. SIMD and MSIMD Variants of the NON-VON Supercomputer , 1984, COMPCON.
[12] Jon Louis Bentley,et al. Multidimensional Binary Search Trees in Database Applications , 1979, IEEE Transactions on Software Engineering.
[13] Howard Jay Siegel,et al. PASM: A Partitionable SIMD/MIMD System for Image Processing and Pattern Recognition , 1981, IEEE Transactions on Computers.
[14] Allen L. Gorin,et al. Computing the Two-Dimensional Discrete Fourier Transform on the ASPEN Parallel Computer Architecture , 1987, International Conference on Parallel Processing.
[15] Svetlana P. Kartashev,et al. Analysis and Synthesis of Dynamic Multicomputer Networks that Reconfigure into Rings, Trees, and Stars , 1987, IEEE Transactions on Computers.
[16] Lawrence Snyder,et al. Introduction to the configurable, highly parallel computer , 1982, Computer.
[17] Siang Wun Song. A highly concurrent tree machine for database applications , 1989 .
[18] Russ Miller,et al. Meshes with reconfigurable buses , 1988 .
[19] Chu-Sing Yang,et al. A reconfigurable modular fault-tolerant binary tree architecture , 1993, Proceedings of Phoenix Conference on Computers and Communications.
[20] Duncan H. Lawrie,et al. Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.
[21] Gérard Giraudon,et al. Image processing on a SIMD/SPMD architecture: OPSILA , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.
[22] Massimo Maresca,et al. Polymorphic-Torus Network , 1989, IEEE Trans. Computers.
[23] Harold S. Stone,et al. Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.
[24] W. Kent Fuchs,et al. Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance , 1987, IEEE Transactions on Computers.
[25] Tse-Yun Feng,et al. Star: A Local Network System for Real-Time Management of Imagery Data , 1982, IEEE Transactions on Computers.
[26] Ellis Horowitz,et al. The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSI , 1981, IEEE Transactions on Computers.
[27] Quentin F. Stout. Sorting, Merging, Selecting, and Filtering on Tree and Pyramid Machines , 1983, ICPP.
[28] Fabrizio Luccio,et al. A VLSI tree machine for relational data bases , 1983, ISCA '83.
[29] David A. Patterson,et al. X-Tree: A tree structured multi-processor computer architecture , 1978, ISCA '78.
[30] Sally Anne Browning,et al. The tree machine: a highly concurrent computing environment , 1980 .
[31] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[32] Hee Yong Youn,et al. A Modular Fault-Tolerant Binary Tree Architecture with Short Links , 1991, IEEE Trans. Computers.
[33] Israel Koren,et al. Embedding Tree Structures in VLSI Hexagonal Arrays , 1984, IEEE Transactions on Computers.
[34] Carlo H. Séquin,et al. Hypertree: A Multiprocessor Interconnection Topology , 1981, IEEE Transactions on Computers.
[35] John F. Beetem,et al. The GF11 supercomputer , 1985, ISCA '85.
[36] Bernard L. Menezes,et al. The KYKLOS Multicomputer Network: Interconnection Strategies, Properties, and Applications , 1991, IEEE Trans. Computers.
[37] James C. Browne. TRAC: An Environment for Parallel Computing , 1984, COMPCON.
[38] W. Daniel Hillis,et al. The connection machine , 1985 .
[39] Kevin P. McAuliffe,et al. The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture , 1985, ICPP.
[40] Jerome Rothstein. Bus automata, brains, and mental models , 1988, IEEE Trans. Syst. Man Cybern..
[41] Milos D. Ercegovac,et al. Fault Tolerance in Binary Tree Architectures , 1984, IEEE Transactions on Computers.
[42] Dhiraj K. Pradhan,et al. Dynamically Restructurable Fault-Tolerant Processor Network Architectures , 1985, IEEE Transactions on Computers.