In this paper we introduce the recursively directed hypercubes, and analyze some of their structural properties. We show that every recursively directed hypercube is acyclic, and has a unique pair of source and sink nodes. The main contribution of the paper is an analysis of distances between the nodes in such a graph. We show that the distance from the source node to any other node, and from a...

Hypercube-based interconnection networks are one of the most popular network topologies when dealing with parallel systems. In a hypercube of dimension n, node addresses are made of n bits, and two nodes are adjacent if and only if their Hamming distance is equal to 1. In this paper we introduce a fault-tolerant hypercube routing algorithm which constructs n minus the number of faulty nodes f d...

In this paper, we present a strongly fault-tolerant design for a d-dimensional hypercube multiprocessor and examine its reconfigurability. The augmented hypercube has a spare node connected to each node of an i-cube and the spare nodes are also connected as a (d i)-dimensional hypercube. By utilizing the circuit-switched capabilities of the communication modules of the spare nodes, large number...

Ghose and Desai [1] introduced a new interconnection for large-scale distributed memory multiprocessors called the Hierarchical Cubic Network (HCN). The HCN is topologically superior to a comparable hypercube. They also proposed optimal routing algorithms for the HCN and obtained its diameter, which is about three-fourths the diameter of a comparable hypercube. However, their routing algorithm ...

In the area of computer simulation Latin hypercube designs play an important role. In this paper the class of maximin Latin hypercube designs is considered. Up to now only several two-dimensional designs and designs for some small number of points are known for this class. Using periodic designs and simulated annealing we extend the known results and construct approximate maximin Latin hypercub...

We consider two definitions of the even-dimensional hypercube given in the literature. The labeled graphs obtained by two definitions are not same, but one is isomorphic to the other. By interconnecting two labeled graphs in such a way that each pair of vertices with the same label are joined by an edge, we construct a vertex-symmetric graph with the diameter about half that of a comparable hyp...