Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Wavelength requirements of all-optical networks
IEEE/ACM Transactions on Networking (TON)
A note on optical routing on trees
Information Processing Letters
Routing a permutation in the hypercube by two sets of edge disjoint paths
Journal of Parallel and Distributed Computing
Adaptive wavelength routing in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective
Optical networks: a practical perspective
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Multiwavelength optical networks with limited wavelength conversion
IEEE/ACM Transactions on Networking (TON)
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wavelength conversion in optical networks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
All-to-all optical routing in optimal chordal rings of degree four
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
NEC Corporation: NEC Cenju-3: A Microprocessor-Based Parallel Computer
Proceedings of the 8th International Symposium on Parallel Processing
Multi-Color Routing in the Undirected Hypercube
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Efficient access to optical bandwidth
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Notes on Shuffle/Exchange-Type Switching Networks
IEEE Transactions on Computers
Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
IEEE Transactions on Computers
Graph Theoretical Analysis and Design of Multistage Interconnection Networks
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Multihop All-to-All Broadcast on WDM Optical Networks
IEEE Transactions on Parallel and Distributed Systems
Recent developments in optical multistage networks
Optical networks
| Hi-index | 0.00 |
To realize a routing request R on a WDM (wavelength division multiplexing) all-optical network, one needs to set up routing paths in the network for every input-output pair in R and to assign a wavelength to each path so that the paths with the same wavelength are edge-disjoint. The optical bandwidth of the WDM all-optical network is the number of wavelengths supported by each link of the network. If the number of wavelengths for realizing R is at most the bandwidth of the network then R can be routed in one round of routing. However, when the number of wavelengths needed is beyond the bandwidth, multiple rounds of routing are required. In this case, it is important to minimize the number of rounds of routing. We give two deterministic algorithms for permutation routings on the parallel computing systems connected by all-optical multistage inter-connection networks (MINs). F or the parallel computing systems with practical size, the first algorithm realizes any permutation in two rounds of routing. The second algorithm realizes any bit-permute-complement (BPC) permutation on the n-dimensional MINs in two rounds of routing.