Arbitrary Group Permutations on Hypercube and Nonblocability of Cube-connected Cycles

Automation and Remote Control, Vol. 63, No. 9, 2002, pp. 1506–1514. Translated from Avtomatika i Telemekhanika, No. 9, 2002, pp. 153–163.Original Russian Text Copyright c© 2002 by Podlazov.

TECHNICAL DIAGNOSIS

Arbitrary Group Permutations on Hypercube

and Nonblocability of Cube-connected Cycles

V. S. Podlazov

Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, RussiaReceived January 3, 2002

Abstract—For packet switching of arbitrary group permutations on the hypercube and arbitrarypermutations on the cube-connected cycles with small number of node channels, methods ofconflictless realization were proposed, and their speed was considered.

1. INTRODUCTION

Works on the communication networks of highly-parallel multiprocessor computer systems focuson permutation of the data elements between N processors (network nodes). Consideration isusually given to the permutation where each network node before and after operation containsa single data element. Group permutation where each network node before and after operationcontains a group of r ≥ 2 data elements is given much less consideration. Group permutation canbe decomposed into a sequence of r conventional permutations, but decomposition is a nontrivialoperation of computational complexity O(rN).

Communication networks are usually divided into dynamic or dedicated and static or directnetworks [1]. The former are multistage (n-cube, inverse n-cube, omega, or Clos–Benes) networksusually based on channel switching. The latter are characterized by rigid neighborhood of nodesand make use of packet switching (multiring, hypercube, multidimensional grid, or cube-connectedcycles).

Among the dynamic networks, only the Clos–Benes ones are nonblockable on arbitrary permu-tations or, more correctly, conditionally nonblockable because any permutation is realized by anindividual schedule. Depending on the degree of parallelism, the algorithm of schedule compilationrequires from O(log2

2 N) to O(N log2 N) operations.In practice, channel switching or its derivative mixed packet-channel switching (the wormhole

and cutthrough techniques) are used without preliminary compilation of schedules, that is, withpossible blockings. This substantially contracts the effective width (parallelism) of the switch,that is, the mean number of data elements transmitted concurrently through it. For example, theeffective width of the n-cube on arbitrary permutations is only

√N [1].

Among the static networks, full p-ary multiring and generalized p-ary hypercube are nonblock-able on arbitrary permutations. Nonblockability is attained by using packet switching and realizingany permutation according to unique static schedules structured as counter-forests [2–6]. At that,on a network with N = pr nodes and mG = r(p− 1) input-output channels arbitrary permutationat each node is realized in n cycles obeying the following expression:

nG(N) =⌈

(prb − 1)(p− 1)rb

⌉+⌈

(pre − 1)(p − 1)re

⌉, where rb = dr/2e and re = br/2c. (1)

0005-1179/02/6309-1506$27.00 c© 2002 MAIK “Nauka/Interperiodica”

ARBITRARY GROUP PERMUTATIONS 1507

For even r, (1) assumes a more convenient form

nG(N) = 2

⌈2(√N − 1)

(p− 1)r

⌉= 2

⌈2(√N − 1)mG

⌉. (2)

According to (1), the number of cycles for arbitrary permutation is minimal and can vary only ifthe number of channels in nodes varies. In this case, the effective width of the hypercube is

N/NG ≈ 0.25√N log2 N, (3)

which for N ≥ 256 is much greater than for the multistage n-cube.The full multiring and generalized hypercube have rather complicated nodes. There exist static

switches with nodes of much lower complexity for their comparable number. For the same numberof nodes N = pr, for example, the p-ary r-cube (multidimensional grid) has mrC = logpN input-output channels at each node, and the cube-connected cycles [7] have for N = r2r nodes onlymcC = 2 ÷ 3 input-output channels at each node. One should discriminate between the cube-connected cycles and cyclic cubes [8] which are close parametrically and quite distinct structurally.Together with the hypercube, they are the Cayley graphs [9] and have smaller diameter as comparedwith the hypercube having a close number of nodes.

No deterministic methods of conflictless realization of arbitrary permutations with given cycledelays are known for these switches. This gives rise to the question whether transmission by thecounter-forest schedules is applicable to them and what are the delays reached in this case. Thepresent author obtained a positive answer for the toral multidimensional grids (p-ary r-cubes forN = pr) [10]. This paper proposes a method of realization of arbitrary permutations on cube-connected cycles and examines its characteristics.

2. HYPERCUBE, CUBE-CONNECTED CYCLES,AND GROUP PERMUTATION ON THE HYPERCUBE

The ordinary—or binary—hypercube has N = 2r nodes. Each node has an r-digit binary

number x = xr−1 . . . xi . . . x0, where xi ∈ [0, 1] and x =r−1∑i=0

xi2i. Any two nodes in hypercube with

numbers differing in one and only one ith position are connected by a duplex channel regardedas that of the ith dimension (i ∈ [0, r − 1]). A formal length 2i is assigned to the channel of ithdimension. The nodes with the numbers having ith positions xi and yi are connected by a channelfrom xi to yi of formal length 2i if and only if (xi + 1) mod 2 = yi.

We characterize the hypercube by a set of formal channel lengths

{SmG} = {1S = 1, 2S, . . . mGS},

where 1S < 2S < . . . < mGS, mG = r, and i+1S = 2i (0 ≤ i ≤ r − 1).A route from the node with the number x = xr−1 . . . xi . . . x0 to the node with the number

y = yr−1 . . . yi . . . y0 has the decomposition (dr−1, . . . , d0) for di ∈ [0, 1] if (xi + di) mod 2 = yi issatisfied for each i. The data element moving over the hypercube uses one cycle to pass the channelof the ith dimension if di = 1, and does not move along the channel of the ith dimension if di = 0.

The formal length d =r−1∑i=0

di2i is assigned to the route with the decomposition (dr−1, . . . , d0).

Passage of any data element along any route in the hypercube is defined by the route schedulecharacterized by the formal route length. It defines the sequence of passing the channels whoselengths are involved in the decomposition of this route and the numbers of cycles in which these

AUTOMATION AND REMOTE CONTROL Vol. 63 No. 9 2002

1508 PODLAZOV

Fig. 1. Three-dimensional cube-connected cycles. The channels of the original hypercube are shown by bold lines.

channels are passed. These cycles can be nonadjacent, that is, alternate with cycles where elementsstay in nodes without moving. These cycles are treated as passage of zero-length channel.

The method of conflictless realization of arbitrary permutation is based on using a static counter-forest schedule where any two route schedules coinciding in a cycle with nonzero length of the passedchannel coincide either in all preceding or all succeeding cycles. This schedule enables conflictlessrealization of arbitrary permutation in the number of cycles obeying (1) for p = 2. It is constructedas a direct Cartesian product of the initial and final unilateral schedules of much smaller size.Table 1 shows examples of such schedules for N = 256. For a greater number of nodes, examplescan be found in [2–6, 10]. In the initial schedule, the channels from the first half of the set SmG areused, and in the final schedule, those from the second half are used. The route schedules coincidingin a cycle coincide in all preceding cycles in the initial schedule and in all succeeding cycles in thefinal schedule.

The cube-connected cycles of dimensionality r with N = r2r nodes are obtained from theordinary 2r-node hypercube by replacing each node by a group of r nodes enumerated within eachgroup from [0, r − 1] and connected by a unilateral ring channel (ring) or two counter-rings. Eachnode of any group is connected with a node of the same name (number) of another group bya duplex channel of the original hypercube whose number of dimension coincides with the nodenumber. Figure 1 depicts an example of three-dimensional cube-connected cycles where the nodesof each group are connected by a pair of counter-rings. In this case, each node has only three

Table 1. Unilateral schedules for the hypercube with N = 256 nodes

Initial schedule Final schedule

L \ T 1 2 3 4 5 6 7 8 T \ L0 01 1 16 162 2 32 323 1 2 32 16 484 4 64 645 4 1 16 64 806 2 4 64 32 967 4 1 2 32 16 64 1128 8 128 1289 8 1 16 128 144

10 2 8 128 32 16011 2 8 1 16 128 32 17612 4 8 128 64 19213 8 1 4 64 16 128 20814 2 8 4 64 128 32 22415 4 1 2 8 128 32 16 64 240L \ T 1 2 3 4 5 6 7 8 T \ L



input-output channels independently of the dimensionality of hypercube. If the nodes of a groupare connected by one ring, there are only two such channels.

Solution of the problem of arbitrary permutation on cube-connected cycles by necessity requiressolution of the problem of group arbitrary permutation on the ordinary hypercube. This becomesevident if each group of the nodes of cube-connected cycles is folded into a node of the ordinaryhypercube retaining the data elements contained in the nodes of the group. Therefore, we considera method of realizing group permutation on hypercube where each data element of any group istransmitted according to a conflictless schedule (Table 1) intended for the ordinary hypercube.Cycles of data element transmission from any node having the same names (numbers) are unitedin a hypercycle having the number of its component cycles. In any hypercycle, the data elementsare transmitted from any node in an arbitrary order. The following theorem is valid.

Theorem 1. For conflictless realization of group permutation on hypercube according to a coun-ter-forest schedule, it is necessary and sufficient that the hypercycle consists of r cycles.

Proof of Necessity. There exist group permutations such that all data elements of some groupshave identical routes. Therefore, their conflictless transmission requires r cycles.

Proof of Sufficiency. Let us assume that on the contrary the hypercycle consist of r + s cycles,where s ≥ 1, which means that there exists a group permutation such that its conflictless realizationrequires transmission of r + s data elements from some node in some hypercycle. This in turnimplies that the route schedules for these data elements coincide in some schedule cycle. Accordingto the property of counter-forest schedule, all these elements have coinciding route schedules inall preceding or succeeding schedule cycles. Therefore, they must have the same sending node ordestination node in the given group permutation, that is, belong to the same group. But there areonly r such elements, which leads to contradiction.

Corollary 1. In each hypercycle, each node has at most r data elements to be transmitted alonga channel of any dimension.

Corollary 2. An arbitrary group permutation is realized without conflicts on the hypercube inrnG cycles.

Among the counter-forest schedules, there are orthogonal schedules [2] enabling one to realizetwo arbitrary (partial) permutations concurrently and without conflicts. For even r, the orthogonalschedules are the mirror reflections of each other, that is, have inversely enumerated cycles. Forodd r, the mirror schedules are constructed by inserting empty cycles to equalize the lengths of theinitial and final schedules. When using mirror schedules, the group is divided into two subgroups ofdr/2e and br/2c terms, the data elements of the first subgroup being transmitted according to thedirect schedule, and those of the second subgroup, by the mirror schedule. The data elements ofdifferent subgroups are transmitted simultaneously. The following counterpart of Theorem 1 withappropriately modified corollaries is valid.

Theorem 2. For conflictless realization of group permutation on hypercube according to the mir-ror forest schedules, it is necessary and sufficient that the hypercycle consists of dr/2e cycles.

3. ARBITRARY PERMUTATIONS ON CUBE-CONNECTED CYCLES

We return to conflictless realization of arbitrary permutation on the cube-connected cycles withN = r2r nodes and decompose all nodes into groups, each group containing nodes connected by ringchannels. Theorem 2 shows that for conflictless realization of permutation it suffices to transmitthe data elements between the nodes of different groups in hypercycles of dr/2e cycles.


1510 PODLAZOV

Table 2. Characteristics of cube-connected cycles

Hypercube Cube-connected cycles Relative characteristics

NG mG nG NcC mcC r ncC mG/mcC ncC/nG ρG

64 6 6 64 2 4 42 2.67 7 2.622K 11 18 2K 2 8 406 5.5 22.56 4.1064 6 6 64 3 4 16 2 2.67 1.34128 7 7 160 3 5 34 2.33 4.85 2.082K 11 18 2K 3 8 120 3.67 6.67 1.824K 12 22 4.5K 3 9 268 4 12.18 3.05

To enable transmission of the data elements along the given routes, transmission between thenodes of each group must precede transmission in the hypercycle. It also must be executed afterthe last hypercycle. Conflictless transmission of a data element from each node to any other nodemay be required before the first hypercycle and after the last hypercycle. This transmission iscarried out concurrently by nodes (like in the loop register) and in the case of a single ring requiresD = r−1 cycles, where D is the ring diameter. In the case of two counter-rings, each data elementmust be transmitted along the ring having the least internode distance. In this case, intragrouptransmission requires only D = br/2c cycles, D denoting here for the diameter of the pair ofcounter-rings.

Conflictless transmission of at most r data elements between any two nodes of any group maybe required before the rest of the hypercycles. It is carried out in succession by data elements andconcurrently by nodes and requires Dr or Ddr/2e cycles, respectively, for one ring or two counter-rings in group. The last expression is due to the fact that the data elements of different subgroupsare transmitted concurrently along shorter routes.

Since intragroup and intergroup transmissions make use of different channels (group rings andhypercube channels), for any hypercycle they, obviously, can be partially superposed in time sothat after transmission along a ring any data element is transmitted through the hypercube channelconcurrently with transmission of the next data element along the ring. In doing so, one hypercycledoes not combine transmission of the first data element along ring(s) and the last data elementthrough the hypercube channel, but they are combined in all neighboring hypercycles, except thefirst one. These hypercycles will be referred to as combined. Duration of the first combinedhypercycle is equal to the diameter of the group. With regard for partial combination of theneighboring hypercycles, durations of the remaining combined hypercycles are Dr or Ddr/2e cycles.The following theorem summarizes the above argument.

Theorem 3. Arbitrary (partial) permutation on cube-connected cycles with NcC = r2r nodes isrealized without conflicts in ncC cycles described by formulas (4), (5). In the presence of one ringin any group of nodes and one hypercycle schedule, (4) is valid for D = r − 1.

ncC = 2D + [nG(NcC/r)− 1] rD. (4)

In the presence of two counter-rings in any group of nodes and mirror hypercycle schedules foreven r, (4) is valid for D = br/2c. For odd r, (4) is replaced by the following formula:

ncC = 2D + [nG(2NcC/r)− 1] dr/2eD. (5)

In (4) and (5), nG(x) is established through (1) for p = 2.Let us compare the characteristics (Table 2) of the hypercube and cube-connected cycles for

identical numbers of nodes. Table 2 contains the parameter ρG = ncCmcC/nGmG showing superi-ority of hypercube over cube-connected cycles in the speed/complexity criterion if speed is defined



as n−1 and complexity is estimated by the number of channels in a node. Table 2 shows that ifonly one ring is used in the node groups of cube-connected cycles, then the time of realization ofarbitrary permutation is very large. A similar conclusion can be drawn for the cube-connectedcycles with odd r. That is why we disregard these cube-connected cycles in what follows.

As one can see from Table 2, the cube-connected cycles are inferior to the hypercube not onlyin speed, but also in the speed/complexity criterion. We attempt to improve this characteristic byincreasing the number of channels in node of cube-connected cycles. We require that the numberof nodes of cube-connected cycles be substantially lower than the number of nodes of a hypercubewith close number of nodes: specifically, mcC ≤ mG/2, or mcC ≈ mG/2, or NcC ≈ NG.

4. ARBITRARY PERMUTATIONS ON GENERALIZED CUBE-CONNECTED CYCLES

The number of channels in cube-connected cycles can be increased in three ways. The firstmethod lies in increasing the number of intergroup channels. To this end, the generalized p-aryhypercube for p ≥ 3 must be taken as the initial hypercube. We obtain p-ary cube-connectedcycles for which mcC = p + 1 (for two rings in group). Figure 2 depicts a ternary hypercubeand the ternary cube-connected cycles obtained from it. In the case of mirror schedules, (4) withD = br/2c and nG(x) calculated from (1) for p > 2 is valid for the cube-connected cycles. Table 3compiles the relative characteristics of the ternary and quaternary cube-connected cycles. Thequaternary cube-connected cycles can be seen to be inferior to hypercube in speed, but superior inthe speed/complexity criterion for N ≤ 1024.

The second approach lies in increasing the number of intragroup rings. Such cube-connectedcycles will be called the multiring cube-connected cycles. This approach is based on the fact thatthe noncommuting sets of rings of different topologies have smaller diameter of the optimal set witha larger number of its channels [4]. Ring topology is defined by the step of increasing the nodenumbers when moving along the ring. The set of rings is defined by the set of their steps. Onecan easily demonstrate that for any odd number of nodes r ≥ 5 (r 6= 7) there exists a set of br/2crings such that its diameter is two. Table 4 presents some of such sets. If it is required to have aneven number r of nodes in group, then for r > 6 it suffices to have in it r + 1 nodes, but to usethe additional node only to support the structure of intragroup connections. Stated differently, theadditional node needs not to have intergroup channels, and the inputs of intragroup channels canbe closed directly to the output.

For the mirror schedules of (binary) multiring cube-connected cycles with mcC = br/2c + 1,formula (4) is valid for D = 2. We note that speed is increased only for r ≥ 6 and only by thefactor of r/4.

In the first two methods, the number of channels in node is not constant. The third methodretains constancy of the number of node channels. It lies in backing up the channels of the original

Fig. 2. Ternary two-dimensional hypercube (a) and ternary two-dimensional cube-connected cycles (b). Allchannels are duplex.


1512 PODLAZOV

Table 3. Characteristics of the p-ary cube-connected cycles

Hypercube p-ary cube-connected cycles Relative characteristics

NG mG nG NcC p r mcC ncC mG/mcC ncC/nG ρG

256 8 8 196 4 3 5 8 1.6 1 0.631K 10 14 1K 4 4 5 24 2 1.71 0.8616K 16 38 24K 4 6 5 123 2.7 3.24 1.20256 8 8 324 3 4 4 16 2 2 14K 12 22 4374 3 6 4 87 3 3.95 1.3264K 16 64 52 488 3 8 4 312 4 4.87 1.21

Table 4. Sets of rings with diameter with 2 (equalities for mod r addition)

r 5 6 9 11 13

{Sr} 1, 4 = −1 1, 3, 5 = −1 1, 3, 4, 7 = −2 1, 3, 4, 5, 9 = −2 1, 3, 4, 5, 6, 11 = −2

hypercube: duplication of the main edge channels or addition of diagonal channel. Diagonal chan-nels are more efficient [2] in terms of speed. In this case, each node has four input-output channels(for two rings in group).

This method is based on adding diagonal channels to the original hypercube. The nodes con-nected by these channels are determined as follows. Let some node of the original hypercube havethe binary number xr−1 . . . xi . . . x0. For any r > i ≥ 0, there are edge channels to the nodeswith the numbers xr−1 . . . xi . . . x0. If i < r/2, this edge channel is matched by a diagonal chan-nel going to the node with the number where the r/2 low-order digits are inverse to the digits ofthe number xr−1 . . . xi . . . x0, that is, have the form xr/2−1 . . . xi . . . x0. If i ≥ r/2, then this edgechannel is matched by a diagonal channel going to the node with inverse r/2 high-order digits,xr−1 . . . xi . . . xr/2.

Addition of diagonal channels duplicates the number of packets in the original channel which isreferred to as strengthened hypercube. The number of cycles of its conflictless schedule obeys thefollowing formula [2]:

nG(N) = 2

⌈(√N − 1)r

⌉. (6)

In cube-connected cycles, the matched edge and diagonal channels become channels of the samenode of any group. For these strengthened cube-connected cycles and mirror schedules, formula (4)is valid with D = br/2c and calculation of nG(x) by (6), which implies doubled speed in comparisonwith the ordinary cube-connected cycles.

Speed can be further improved by using jointly first and second or second and third methods.In the former case, one gets p-ary multiring cube-connected cycles with mcC = p− 1 + r/2 (r ≥ 4)channel in each node. For mirror schedules, formula (4) is valid for it for D = 2 and p > 2. Thecharacteristics of these cube-connected cycles are compared in Table 5.

In the second case, one gets strengthened multiring cube-connected cycles with mcC = 2 + r/2channels in each node. In the case of mirror schedules, formula (4) is valid for it for D = 2 andp = 2. The characteristics of these cube-connected cycles are compared in Table 6.

Tables 5 and 6 show that in terms of the speed/complexity criterion the proposed modificationsof cube-connected cycles make it at least as good as the hypercube. Stated differently, the number ofcycles of conflictless realization of arbitrary permutation is increased approximately as many times



Table 5. Characteristics of the p-ary multiring cube-connected cycles

Hypercube p-ary Relativemultiring cube-connected cycles characteristics

NG mG nG NcC p r mcC ncC mG/mcC ncC/nG ρG

256 8 8 196 4 3 5 8 1.6 1 0.631K 10 14 1K 4 4 5 24 2 1.71 0.8616K 14 38 24K 4 6 6 82 2.33 2.16 0.92512K 19 160 512K 4 8 7 348 2.71 2.18 0.8256 8 8 324 3 4 4 16 2 2 14K 12 22 4374 3 6 5 58 2.4 2.64 1.1064K 16 64 52 488 3 8 6 156 2.67 2.44 0.91

Table 6. Characteristics of strengthened multiring cube-connected cycles

Hypercube Strengthened multiring Relativecube-connected cycles characteristics

NG mG nG NcC r mcC ncC mG/mcC ncC/nG ρG

64 6 6 64 4 4 8 1.5 1.33 0.89512 9 11 384 6 5 22 1.8 2 1.112K 11 18 2K 8 6 28 1.83 1.56 0.8516K 14 38 10K 10 7 74 2 1.95 0.97

Table 7. Characteristics of ternary cube-connected cycles and four-dimensional toral grid

Grid Cube-connected cycles Relative characteristics

NrC mrC nrC NcC p r mcC ncC mrC/mcC ncC/nrC ρrC

256 8 12 324 3 4 4 16 2 1.33 0.664K 8 40 4374 3 6 5 58 1.6 1.45 0.9164K 8 144 52 488 3 8 6 156 1.33 1.08 0.81

Table 8. Characteristics of ternary cube-connected cycles and the matrix of OTIS grids

OTIS matrix Cube-connected cycles Relative characteristics

NOTIS mOTIS nOTIS NcC p r mcC ncC mOTIS/mcC ncC/nOTIS ρOTIS

256 6 15 324 3 4 4 16 1.5 1.07 0.714K 6 45 4374 3 6 5 58 1 1.29 1.2964K 6 153 52 488 3 8 6 156 0.75 1.08 1.36

as the number of channels in the node of modified cube-connected cycles is reduced as comparedwith hypercube.

Let us also compare the characteristics on arbitrary permutations of modified cube-connectedcycles and four-dimensional toral grid [10] where the number of nodes is NrC = p4, the numberof channels in node upon realizing each edge as two counter-rings is mrC = 8, and that of cycles

of conflictless realization of arbitrary permutation is nrC =⌈

(p+ 1)2

⌉p. The characteristics of

these switches are compiled in Table 7 where ρrC = mcCncC/mrCnrC defines superiority of thegrid over cube-connected cycles in the speed/complexity criterion. As one can see, the modifiedcube-connected cycles have somewhat lower speed than the four-dimensional grid and somewhatbetter speed/complexity criterion.


1514 PODLAZOV

We conclude by comparing the characteristics of the modified cube-connected cycles and matrixof two-dimensional OTIS grids with exchange connections [10]. Here, the number of nodes isNOTIS = p4, the number of channels in node is mOTIS = 6 for realizing each edge as two counter-

rings, and the number of cycles of realization of arbitrary permutation is nOTIS =⌈

(p+ 1)2

⌉(p+1).

The characteristics of these switches are compiled in Table 8. Here, the modified cube-connectedcycles have superiority in the speed/complexity criterion only for a small number of nodes N ≤ 256,and for greater number of nodes the OTIS matrix is superior in this criterion to all cube-connectedcycles considered above.

5. CONCLUSIONS

This paper concludes a cycle of publications [2–6, 10] on providing nonblockability for packetswitching on arbitrary permutations of direct static switches such as full multiring, generalizedhypercube, and their derivative multidimensional toral grid and cube-connected cycles. Theseswitches are characterized by lower number of node channels. As was shown in these publications,all such switches are nonblockable if in each node identical static counter-forest schedules are usedindependently. Methods of using these schedules in various switches were developed, and formulasto calculate the number of cycles of conflictless realization of arbitrary permutation were obtained.

Studies demonstrated that in the series of hypercube—multidimensional grid—cube-connectedcycles there exist modifications having approximately the same magnitude of the product of thenumber of channels by the number of cycles of realization of arbitrary permutation as the hypercube(with the coefficient 0.7–1.3).

REFERENCES

1. Veselovskii, G.G., Karavai, M.F., and Kuznechik, S.M., Switching Networks in Multiprocessor ComputerSystems with Common Control, Avtom. Telemekh., 1989, no. 2, pp. 3–29.

2. Podlazov, V.S., Nonblockability Conditions for Multiring Switches and Generalized Hypercubes on Ar-bitrary Permutations. I, Avtom. Telemekh., 2001, no. 8, pp. 118–126.

3. Podlazov, V.S., Nonblockability Conditions for Multiring Switches and Generalized Hypercubes on Ar-bitrary Permutations. II, Avtom. Telemekh., 2001, no. 9, pp. 114–124.

4. Allenov, A.V. and Podlazov, V.S., Throughput of the Set of Ring Channels, II, Avtom. Telemekh., 1996,no. 4, pp. 162–172.

5. Podlazov, V.S., Decentralized Static Conflict-free Routing for Ring Switches and Hypercubes, Avtom.Telemekh., 1999, no. 4, pp. 79–89.

6. Podlazov, V.S., Nonblockable Ring Switches: Redundancy and Speed, Avtom. Telemekh., 1999, no. 10,pp. 153–163.

7. Preperata, F. and Vuillemin, J., The Cube-connected Cycles Versatile Network for Parallel Computation,Commun. ACM, 1981, vol. 24, no. 5, pp. 30–39.

8. Fu, A.W. and Chau, S.C., Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees, IEEE Trans. Parallel Distrib. Syst., 1998, vol. 9, no. 12, pp. 1253–1268.

9. Akers, S.B. and Krishnamurthy, B., A Group-theoretic Model for Symmetric Interconnection Networks,IEEE Trans. Comput., 1989, vol. 38, no. 4, pp. 555–566.

10. Podlazov, V.S., Nonblockability of Arbitrary Permutations on the Switch Structured as MultidimensionalGrid, Avtom. Telemekh., 2002, no. 8, pp. 178–188.

This paper was recommended for publication by P.P. Parkhomenko, a member of the EditorialBoard


Documents

Arbitrary Group Permutations on Hypercube and Nonblocability of Cube-connected Cycles