The generation of arbitrary permutations ( identical to rearrangeable-nonblocking interconnections) by 2-D multistage architectures with nearest-neighbours interconnected switches is analysed. Two different networks are presented and their relationship is shown by means of a transformation
We consider switching networks consisting of subscriber lines and crosswires connected by switches. ...
We consider the problem of designing a simple, oblivious scheme to generate (almost) random permutat...
AbstractSwitching networks of the type used in telephone exchanges are studied, with emphasis on a p...
Selfrouting in multistage interconnection networks (MINs) with nearest-neighbour (NN) interstage int...
The permutation of switches is applied to generate (1) butterfly, (2) crossover and (3) global/local...
Abstract. Rearrangeable networks can realize each and every permutation in one pass through the netw...
[[abstract]]Benes networks are nonblocking rearrangeable networks that can realize arbitrary permuta...
The transformations of a two-dimensional shuffle on a 4*4 array into a one-dimensional shuffle on a ...
The decomposition of 2-D shuffle multistage interconnection networks without loss of functionality i...
Rearrangeable multistage interconnection networks such as the Benes network realize any permutation,...
Abstract—Two-stage constructions and banyan-type networks play important roles in designing high spe...
Multistage interconnection networks are conventionally composed of 2x2 switching elements which perf...
In (2n- 1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n²) com...
Communication in systems with a high number of processors strongly relies on the interconnection net...
Abstract-We present analytic models for the blocking proba-bility of both unique path and multiple p...
We consider switching networks consisting of subscriber lines and crosswires connected by switches. ...
We consider the problem of designing a simple, oblivious scheme to generate (almost) random permutat...
AbstractSwitching networks of the type used in telephone exchanges are studied, with emphasis on a p...
Selfrouting in multistage interconnection networks (MINs) with nearest-neighbour (NN) interstage int...
The permutation of switches is applied to generate (1) butterfly, (2) crossover and (3) global/local...
Abstract. Rearrangeable networks can realize each and every permutation in one pass through the netw...
[[abstract]]Benes networks are nonblocking rearrangeable networks that can realize arbitrary permuta...
The transformations of a two-dimensional shuffle on a 4*4 array into a one-dimensional shuffle on a ...
The decomposition of 2-D shuffle multistage interconnection networks without loss of functionality i...
Rearrangeable multistage interconnection networks such as the Benes network realize any permutation,...
Abstract—Two-stage constructions and banyan-type networks play important roles in designing high spe...
Multistage interconnection networks are conventionally composed of 2x2 switching elements which perf...
In (2n- 1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n²) com...
Communication in systems with a high number of processors strongly relies on the interconnection net...
Abstract-We present analytic models for the blocking proba-bility of both unique path and multiple p...
We consider switching networks consisting of subscriber lines and crosswires connected by switches. ...
We consider the problem of designing a simple, oblivious scheme to generate (almost) random permutat...
AbstractSwitching networks of the type used in telephone exchanges are studied, with emphasis on a p...
DOI
Add to ORKG