TI A New Implementation for Hypercube Connection 

AV ftp thorhild.cs.ualberta.ca:pubTR91-09.ps.Z 

AV mail britta@cs.ualberta.ca  

OR ALBRT 

LT TR 91-09 

AU Zhiyong Liu 

AU Jia You 

MN May 

YR 1991 

AB We present an interconnection network named 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  show that the set of permutations
realizable in one pass (log2N steps) through syncube without
precomputation is largely greater than that through an MIN like 
network or its equivalence.  We will present new alogrithms to
realize frequently used permutations on hypercube as well as on
syncube.  The algorithms can make full use of the connections
among all the nodes in every dimension all the time, and can
realize log2N permutations simultaneously so that communication
bandwidth is fully increased.  In addition, syncube has a merit
over MINs that it can efficiently benefit localized
communications.