Subscribe

Beijing, CHINA

June 12, 1996 to June 14, 1996

ISBN: 0-8186-7460-1

pp: 97

Hui-Ling Huang , Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan

Gen-Huey Chen , Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan

ABSTRACT

Although many networks have been proposed as the topology of a large-scale parallel and distributed system. Most of them are neither expansible nor of equal degree. The inexpansibility and inequality of node degrees will make their VLSI implementation more difficult and more expensive. The hypernet, which was proposed by Hwang and Ghosh, represents a family of recursively scalable networks that are both expansible and of equal degree. In addition to the two merits, the hypernet has proven efficient for communication and computation. But, unfortunately, most topological properties and the problem of shortest-path routing for the hypernet are still unsolved. In this paper, we are concerned with the hypernet of two levels, we obtain the following results: (1) a shortest-path routing algorithm, (2) the diameter, (3) the connectivity, and (4) embedding of a ring, a torus, and a hypercube.

INDEX TERMS

multiprocessor interconnection networks; parallel architectures; hypernet; shortest-path routing; diameter; connectivity; embedding; recursively scalable networks; topological properties

CITATION

Hui-Ling Huang,
Gen-Huey Chen,
"Shortest-path routing algorithm and topological properties for two-level hypernet networks",

*ISPAN*, 1996, Parallel Architectures, Algorithms, and Networks, International Symposium on, Parallel Architectures, Algorithms, and Networks, International Symposium on 1996, pp. 97, doi:10.1109/ISPAN.1996.508967