Parallel routing algorithms for incomplete hypercube interconnection networks

A severe restriction on a complete hypercube topology is that the number of processors must be a power of 2. Such a restriction limits its applicability. An incomplete hypercube may provide more flexibility in system sizes. There are three classes of variant incomplete hypercube interconnection networks: I/sup r//sub m/, I/sup r//sub M/ and I/sup r//sub A/. The authors focus on the parallel routing algorithms for these three classes of incomplete hypercubes. Parallel paths between any given two nodes mean that these paths have the same source and destination nodes but with different intermediate nodes. Parallel communication can speed up the data transfer operation and increase the system fault-tolerance and the communication reliability between two nodes.<>