论文信息 - Structural properties of incomplete hypercube computers

Structural properties of incomplete hypercube computers

Incomplete hypercubes are analyzed. The elementary properties of complete hypercubes and a routing algorithm for incomplete hypercubes are briefly reviewed. Structural properties, including diameter, mean message traversal, and traffic density, of incomplete hypercube computers with size 2/sup n/+2/sup k/, 0<or=k<n, are investigated and presented. It is shown that traffic density in such an incomplete hypercube is bounded by two, despite its structural nonhomogeneity. Thus, cube links can easily be constructed so as to avoid any single point of congestion, guaranteeing good performance.<<ETX>>

Nian-Feng Tzeng

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

[2] Richard M. Fujimoto,et al. Multicomputer Networks: Message-Based Parallel Processing , 1987 .

[3] Angela Y. Wu,et al. Embedding of tree networks into hypercubes , 1985, J. Parallel Distributed Comput..

[4] Jon S. Squire,et al. Programming and design considerations of a highly parallel computer , 1963, AFIPS '63 (Spring).

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

[6] Theodore R. Bashkow,et al. A large scale, homogeneous, fully distributed parallel machine, I , 1977, ISCA '77.

[7] Howard P. Katseff,et al. Incomplete Hypercubes , 1988, IEEE Trans. Computers.

[8] John P. Hayes,et al. Architecture of a Hypercube Supercomputer , 1986, ICPP.

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

[10] D. Grunwald,et al. The Performance of Multicomputer Interconnection Networks , 1987, Computer.

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

[12] Ming-Syan Chen,et al. Processor Allocation in an N-Cube Multiprocessor Using Gray Codes , 1987, IEEE Transactions on Computers.

[13] Larry D. Wittie,et al. Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.