A fiber optic hypermesh for SIMD/MIMD machines
暂无分享,去创建一个
[1] V. Benes,et al. Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .
[2] Douglas Stott Parker,et al. Notes on Shuffle/Exchange-Type Switching Networks , 1980, IEEE Transactions on Computers.
[3] Howard Jay Siegel. The Theory Underlying the Partitioning of Permutation Networks , 1980, IEEE Transactions on Computers.
[4] Ted H. Szymanski,et al. On the Permutation Capability of a Circuit-Switched Hypercube , 1989, International Conference on Parallel Processing.
[5] J. M. Cooper,et al. Multiwavelength optical crossconnect for parallel-processing computers , 1988 .
[6] Takahiro Numai,et al. A photonic wavelength-division switching system using tunable laser diode filters , 1990 .
[7] Jacques Lenfant,et al. Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations , 1978, IEEE Transactions on Computers.
[8] Kai Y. Eng. A photonic knockout switch for high-speed packet networks , 1988, IEEE J. Sel. Areas Commun..
[9] André Seznec,et al. A New Interconnection Network for SIMD Computers: The Sigma Network , 1987, IEEE Transactions on Computers.
[10] Marshall C. Pease,et al. The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.
[11] Duncan H. Lawrie,et al. Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.
[12] W. Daniel Hillis,et al. The connection machine , 1985 .
[13] Larry D. Wittie,et al. Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.
[14] Robert J. McMillen,et al. The Multistage Cube: A Versatile Interconnection Network , 1981, Computer.
[15] Ted H. Szymanski,et al. On the Permutation Capability of Multistage Interconnection Networks , 1987, IEEE Transactions on Computers.
[16] D. Grunwald,et al. The Performance of Multicomputer Interconnection Networks , 1987, Computer.
[17] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[18] William J. Dally,et al. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.
[19] Haim Kobrinski,et al. HYPASS: an optoelectronic hybrid packet switching system , 1988, IEEE J. Sel. Areas Commun..
[20] Ted H. Szymanski. An analysis of 'hot-potato' routing in a fiber optic packet switched hypercube , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.
[21] John B. Thomas,et al. Optimal coding schemes for conflict-free channel access , 1989, IEEE Trans. Commun..
[22] S. Andresen. The Looping Algorithm Extended to Base 2tRearrangeable Switching Networks , 1977, IEEE Trans. Commun..
[23] David Hung-Chang Du,et al. Efficient CSMA/CD-Based Protocols for Multiple Priority Classes , 1989, IEEE Trans. Computers.
[24] Jean-Claude Bermond,et al. Large hypergraphs of diameter one , 1984 .
[25] Anna Lubiw,et al. Counterexample to a Conjecture of Szymanski on Hypercube Routing , 1990, Inf. Process. Lett..
[26] Yoram Ofek. Integration of voice communication on a synchronous optical hypergraph , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.
[27] H. S. Hinton,et al. Photonic switching fabrics , 1990, IEEE Communications Magazine.
[28] Gérard Memmi,et al. Some New Results About the (d, k) Graph Problem , 1982, IEEE Transactions on Computers.