Self-routing in multistage networks based on nearest-neighbor interconnects
暂无分享,去创建一个
[1] Kyungsook Y. Lee. On the Rearrangeability of 2(log2N) - 1 Stage Permutation Networks , 1985, IEEE Trans. Computers.
[2] Shahid H. Bokhari,et al. Assignment Problems in Parallel and Distributed Computing , 1987 .
[3] Marina C. Chen,et al. A Design Methodology for Synthesizing Parallel Algorithms and Architectures , 1986, J. Parallel Distributed Comput..
[4] H. R. Ramanujam. Decomposition of Permutation Networks , 1973, IEEE Transactions on Computers.
[5] R A Spanke,et al. N-stage planar optical permutation network. , 1987, Applied optics.
[6] Josef Giglmayr. Comparison of regular 3D interconnections , 1993, Other Conferences.
[7] V. E. Bene. Proving the rearrangeability of connecting networks by group calculations , 1975, The Bell System Technical Journal.
[8] A A Friesem,et al. On the limits of optical interconnects. , 1992, Applied optics.
[9] Pen-Chung Yew,et al. An Easily Controlled Network for Frequently Used Permutations , 1981, IEEE Transactions on Computers.
[10] B. Glance,et al. Multigigabit 1 × 10 optical packet switching based on WDM , 1992 .
[11] Shing-Tsaan Huang,et al. Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks , 1986, IEEE Transactions on Computers.
[12] Josef Giglmayr. Minimum number of crossed channels for OFDM systems based on regular interconnections , 1992, Other Conferences.