الفهرس 
CHPTER 1: General IntroductionOnly 14 pages are availabe for public view
 |  | from | 102 |  |  |
| | | from | 102 | | |
Abstract
Photonic components are being further integrated; particular attention is given to integrated high speed optical interconnection networks for modern computer systems. Optical multistage interconnection networks (OMIN) are popular in switching and communication of high speed optical interconnection network applications like parallel computing systems. However, OMIN introduce crosstalk which results from coupling two signals into one Switching Element (SE), a major problem that limits the performance of the network, and its size.
Presented work introduced our proposed methods of scheduling in OMIN; fast window, fast improved window and fast bitwise window method for reducing the running time, and compared its effect on the running time and number of passes through the scheduling operation with the traditional methods.
Crosstalk free routing algorithms are used to rout data packet from a source to its corresponding destination through switches without crosstalk. We discuss the implementation of our proposed fast scheduling methods fast window methods to the traditional routing algorithm; zero algorithms and four heuristic algorisms in terms of algorithm running time, network size, and number of passes. This work results reducing the running time and gives the ability to extend the network size up to 213 computing units.
Under the constraint of avoiding crosstalk, this work deals with the application of proposed modified fast zero heuristic algorithms for routing in OMIN. The results indicates that The proposed fast Zero Heuristic algorithm are successful to reduce the time by 20% or more per every execution the algorithms for the different network sizes. The fast Zero Heuristic algorithms can be considered more appropriate for finding the execution time for a given network compared with the standard heuristic algorithms.