The decomposition of 2-D shuffle multistage interconnection networks without loss of functionality is presented and analyzed. The major costs for the decomposition arise by the interconnection of the subdivided switches. The attempts considered differ with regard to the implementation of the dimension-dependent switches (hybrid and all-optical) and with regard to the organization of the interconnection scheme (hierarchical and direct). These attempts are described, evaluated and compared. The application of the decomposition to distributed switching/processing is briefly illustrated
Abstract—Plane-to-plane guided-wave-based interconnection modules are proposed as building blocks fo...
Abstract. Rearrangeable networks can realize each and every permutation in one pass through the netw...
The need for d-dimensional (d>or=3) interconnection patterns occurs if d-dimensional data cubes have...
This paper discusses the need for 2-D multistage optical interconnection networks in parallel comput...
The transformations of a two-dimensional shuffle on a 4*4 array into a one-dimensional shuffle on a ...
The various possibilities of optically interconnecting 16*16-data arrays by shuffle patterns are pre...
Interconnection systems inside switching equipment, high-performance computers and data-centers are ...
Abstract—Interconnection systems inside switching equipment, high-performance computers and data-cen...
The generation of arbitrary permutations ( identical to rearrangeable-nonblocking interconnections) ...
Methods that a designer can use to optimize the placement of nodes in a large switching network to d...
Requirements on switching and interconnection fabrics inside switching equipment, high-performance ...
Communication in systems with a high number of processors strongly relies on the interconnection net...
Interconnection networks provide an effective means by which components of a system such as processo...
The paper describes a multistage interconnection network (MIN) with regular interconnections in thre...
Selfrouting in multistage interconnection networks (MINs) with nearest-neighbour (NN) interstage int...
Abstract—Plane-to-plane guided-wave-based interconnection modules are proposed as building blocks fo...
Abstract. Rearrangeable networks can realize each and every permutation in one pass through the netw...
The need for d-dimensional (d>or=3) interconnection patterns occurs if d-dimensional data cubes have...
This paper discusses the need for 2-D multistage optical interconnection networks in parallel comput...
The transformations of a two-dimensional shuffle on a 4*4 array into a one-dimensional shuffle on a ...
The various possibilities of optically interconnecting 16*16-data arrays by shuffle patterns are pre...
Interconnection systems inside switching equipment, high-performance computers and data-centers are ...
Abstract—Interconnection systems inside switching equipment, high-performance computers and data-cen...
The generation of arbitrary permutations ( identical to rearrangeable-nonblocking interconnections) ...
Methods that a designer can use to optimize the placement of nodes in a large switching network to d...
Requirements on switching and interconnection fabrics inside switching equipment, high-performance ...
Communication in systems with a high number of processors strongly relies on the interconnection net...
Interconnection networks provide an effective means by which components of a system such as processo...
The paper describes a multistage interconnection network (MIN) with regular interconnections in thre...
Selfrouting in multistage interconnection networks (MINs) with nearest-neighbour (NN) interstage int...
Abstract—Plane-to-plane guided-wave-based interconnection modules are proposed as building blocks fo...
Abstract. Rearrangeable networks can realize each and every permutation in one pass through the netw...
The need for d-dimensional (d>or=3) interconnection patterns occurs if d-dimensional data cubes have...