Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An introduction to parallel algorithms
An introduction to parallel algorithms
A Fast Parallel Algorithm for Routing Unicast Assignments in Benes Networks
IEEE Transactions on Parallel and Distributed Systems
Optical networks: a practical perspective
Optical networks: a practical perspective
Permutation capability of optical multistage interconnection networks: 72
Journal of Parallel and Distributed Computing
Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE/ACM Transactions on Networking (TON)
Graph Theory With Applications
Graph Theory With Applications
Parallel Algorithms to Set Up the Benes Permutation Network
IEEE Transactions on Computers
Performance of Processor-Memory Interconnections for Multiprocessors
IEEE Transactions on Computers
Analysis of space-time tradeoffs in photonic switching networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Optical multistage interconnection networks: new challenges and approaches
IEEE Communications Magazine
Wide-sense nonblocking Banyan-type switching systems based on directional couplers
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Benes networks are rearrangeable nonblocking networks and are among the most efficient switching architectures in terms of the number of [image omitted] switching elements (SEs) used. In optical Benes networks, if two I/O connecting paths with the same (close) wavelength(s) share a common SE, crosstalk occurs. In order to reduce the crosstalk effect, three approaches, time, space and wavelength dilations have been proposed. In this paper, we present polylogarithmic-time reconfiguration algorithms for realizing any (partial) permutation in time, space and wavelength dilated optical Benes networks using a linear number of processors. Our algorithms are based on a logarithmic-time permutation decomposition algorithm and apply graph coloring techniques such as edge coloring, equitable coloring and vertex coloring.