M. Mittal

Learn More
This paper presents optimal setup procedures for cube-connected networks. The setup patterns include paths, transpositions, cycles, and one-pass permutations. For an N-input cube-connected network, the procedure for paths requires O(log 2 N) steps, and O(N) space, that for transpositions and cycles requires O(N) steps, and O(N) space, and that for(More)
Two compact schemes, namely the half and three-partition representations are introduced for coding the topology of cube-connected networks. Based on these representations, recursive algorithms are 8ivan to realize paths, transpositions, cycles and, permutations through such networks, It is also shown that a cube connected network can realize an arbitrary(More)
  • 1