A new class of interconnection network topology is proposed for parallel and distributed processing. The interconnection is based on the Generalized Hypercube and the Supercube systems. Given the number of nodes N and the desired diameter k, a topology can be constructed. The node degree of each node is between k([k√N] - 1) and ((2k - 1)([k√N] - 1) - 1). The connectivity of the network is at least k([k√N] - 1). It has been shown that the connectivity of the network is equal to the minimum node degree. In this sense it is an optimally fault-tolerant network. In addition, there exist at least k([k√N] - 1) paths of length ≤ k + 1 between any two nodes in an N-node super generalized hypercube with specified diameter k.
|Number of pages||8|
|Journal||Computer Systems Science and Engineering|
|State||Published - 1 Jan 1995|