Programming the twisted-cube architectures

A network is proposed that preserves all of the properties of the hypercube, but has a diameter which is only about half of that of the hypercube. This network is self-routing, in the sense that there is a simple distributed routing algorithm which guarantees optimal paths between any pair of vertices. This fact, together with other properties such as regularity, symmetry, high connectivity, and a simple recursive structure, implies that the multiply twisted cube is an alternative to the ordinary hypercube for massively parallel architectures. Single-input multiple-data stream algorithm were developed which utilize the new architecture. The multiply-twisted hypercube architecture can be used to profitably emulate the ordinary hypercube. Some of the basic properties of this network are discussed, the programming issues are emphasized, and it is shown that any hypercube algorithm can be mapped to run on the new architecture. In many cases this mapping results in a substantial reduction in the running time due to more efficient routing of data between processors.<<ETX>>

[1]  Sartaj Sahni,et al.  Programming a hypercube multicomputer , 1988, IEEE Software.

[2]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[3]  Sergiu Hart,et al.  A note on the edges of the n-cube , 1976, Discret. Math..

[4]  Frank Harary,et al.  Graph Theory , 2016 .

[5]  Yousef Saad,et al.  Multigrid Algorithms on the Hypercube Multiprocessor , 1986, IEEE Transactions on Computers.

[6]  J. Spencer,et al.  EVOLUTION OF THE n-CUBE , 1979 .

[7]  Lionel M. Ni,et al.  On Enhancing Hypercube Multiprocessors , 1988, ICPP.

[8]  Bernd Becker,et al.  How robust is the n-cube? , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[9]  Makoto Imase,et al.  Design to Minimize Diameter on Building-Block Network , 1981, IEEE Transactions on Computers.

[10]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[11]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[12]  Henry Martyn Mulder.  N-cubes and Median Graphs , 1980, J. Graph Theory.

[13]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[14]  S. Foldes,et al.  A characterization of hypercubes , 1977, Discret. Math..