Routing and scheduling for a novel optical multistage interconnection network

Authors:
Siu-Cheung Chau;Tiehong Xiao;Ada Wai-Chee Fu
Affiliations:
Dept. of Physics and Computer Science, Wilfrid Laurier University, Waterloo, Ontario, Canada;Dept. of Computing and Information Science, University of Guelph, Guelph, Ontario, Canada;Dept. of Computer Science and Engineering, Chinese University of Hong Kong, Shatin, Hong Kong
Venue:
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Year:
2005

Citing 6
Cited 0

A two-level process for diagnosing crosstalk in photonic dilated Benes networks

Journal of Parallel and Distributed Computing - Special issue on parallel computing with optical interconnects
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
Message Routing and Scheduling in Optical Multistage Networks Using Simulated Annealing

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Optimal all-to-all personalised exchange in a novel optical multistage interconnection network

International Journal of High Performance Computing and Networking
Optical multistage interconnection networks: new challenges and approaches

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multistage Interconnection Networks (MINs) are popular in computing and communication applications. Recently, there have also been significant advancesin electro-optic switches that have made Optical MINs (OMINs) a good choice for the high channel bandwidth and low communication latency of high performance computing and communication applications. However, OMINs introduce crosstalkwhich results fromcoupling two signals within oneswitching element. Under the constraint of avoiding crosstalk, what we are interested inis how to realize a permutation that requires theminimum number of passes. This routing problem is an NP-hard one, and manyheuristic algorithms have been devised to find a solution. In [9], Chau and Xiao have proposed an algorithm, called the Remove Last Pass (RLP) algorithm, to avoid crosstalk and route the traffic in an OMIN more efficiently. In this paper, we focus on the routing and scheduling of a novel OMIN, the base-2 MIN, propoundedby Chau and Fu in [8]. Our experiments provethat any permutation can be realized in no more than threepasses in the base-2 OMIN by using the RLP algorithm, when the network has no more than 512 nodes. The base-2 OMIN requires only n(logn+1) switching elements (SEs)for an n×n network, compared to the crossbar, which requires O(n2) SEs for an n×n network. Therefore,the base-2 MIN should be a good candidate for communication subsystems in a parallel computing environment.