A Super-cube Interconnection NetworkFor Parallel Computers

In this paper, we consider some interconnection networks for parallel computers. Let d be the greatest distance in a network, and let / be the maximum number of circuits connected from optional processor. It is well known, for the hypercube interconnection network, d = Iog2%, / = Iog2?%, where n is the number of processors in the network. In this paper, we present a super-cube interconnection network for parallel computers. For this new interconnection network, d and / both satisfies d < 0.86 logg n and / < 0.86 log n.