Simple Search:

Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network


Citation

Abduh Kaid, Monir Abdullah (2005) Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network. Masters thesis, Universiti Putra Malaysia.

Abstract / Synopsis

As optical technology advances, there is a considerable interest in using this technology to implement interconnection networks and switches. Optical multistage interconnection network is popular in switching and communication applications. It has been used in telecommunication and parallel computing systems for many years. A major problem known as crosstalk is introduced by optical multistage interconnection network, which is caused by coupling two signals within a switching element. It is important to focus on an efficient solution to ,avoid crosstalk, which is routing traffic through an N x N optical network to avoid coupling two signals within each switching element.Under the constraint of avoiding crosstalk, we are interested in realising a permutation that will use the minimum number of passes to send all messages. This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. The first approach is to develop an efficient sequential algorithm for the window method. Reduction of the execution time of the algorithm in sequential platform, led to a massive improvement of the algorithm speed. Also an improved simulated annealing is proposed to solve the routing problem. The efficient combination of simulated annealing algorithm with the best heuristic algorithms gave much better result in a very minimal time. Parallelisation is another approach in our research. Three parallel strategies of the window method are developed in this research. The parallel window method with low communication overhead decreased 86% of the time compared to sequential window method. The parallel simulated annealing algorithm is also developed and it reduces 64% of the time compared to sequential simulated annealing.


Download File

[img]
Preview
PDF
FSKTM_2005_4(1-24).pdf

Download (1MB)

Additional Metadata

Item Type: Thesis (Masters)
Subject: Sequential processing (Computer science)
Subject: Parallel processing (Electronic computers)
Subject: Database searching
Call Number: FSKTM 2005 4
Chairman Supervisor: Associate Professor Mohamed Othman, PhD
Divisions: Faculty of Computer Science and Information Technology
Depositing User: Nur Izyan Mohd Zaki
Date Deposited: 05 May 2010 16:42
Last Modified: 27 May 2013 15:25
URI: http://psasir.upm.edu.my/id/eprint/5850
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item