Increasing communication bandwidth on hypercube
We present an interconnection network, called Syncube, which is a new implementation scheme of hypercube. The hardware complexity of syncube is O(Nlog2N). Communication is much faster through syncube than that through a traditional hypercube with the same hardware complexity. We will give algorithm which can make full use of the connections and can realize log2N permutations simultaneously so that communication bandwidth is fully increased.
Key wordsParallel and distributed processing interconnection network hypercube complexity permutations communication bandwidth
Unable to display preview. Download preview PDF.
- A. Borodin and J. E. Hopcroft. Routing, merging and sorting on parallel models of computation. In Proc. of the 14th Annual Symposium on Theory of Computing, pages 338–344, May 1982.Google Scholar
- M. T. Heath, editor. Hypercube Multiprocessors 1987. SIAM, Philadelphia, 1987.Google Scholar
- W. D. Hillis. The Connection Machine. MIT Press, Cambridge, MA, 1985.Google Scholar
- K.Y. Lee. On the rearrangeability of 2(log2 N) — 1 stage permutation networks. IEEE Trans. on Computers, C-34(5):412–425, May 1985.Google Scholar
- J. Lenfant. Parallel permutations of data: A Benes network control algorithm for frequently used permutations. IEEE Trans. on Computers, C-27(7):637–647, July 1978.Google Scholar
- Z. Liu and J. You. Routing algorithms for hypercube. Technical Report 90-26, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1, 1990.Google Scholar
- C. McCrosky. Message passing in synchronous hypercubes. Technical Report 86-4, Department of Computational Science, University of Saskatchewan, Saskatoon, Canada, 1986, (to appear in Computer System Science and Engineering).Google Scholar
- A. Waksman. A permutation network. Journal of the ACM, 15(1):159–163, Jan. 1968.Google Scholar