Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Louisiana State University

LSU Doctoral Dissertations

Optical networks

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

Broadcast In Sparse Conversion Optical Networks Using Fewest Converters, Tong Yi Jan 2005

Broadcast In Sparse Conversion Optical Networks Using Fewest Converters, Tong Yi

LSU Doctoral Dissertations

Wavelengths and converters are shared by communication requests in optical networks. When a message goes through a node without a converter, the outgoing wavelength must be the same as the incoming one. This constraint can be removed if the node uses a converter. Hence, the usage of converters increases the utilization of wavelengths and allows more communication requests to succeed. Since converters are expensive, we consider sparse conversion networks, where only some specified nodes have converters. Moreover, since the usage of converters induces delays, we should minimize the use of available converters. The Converters Usage Problem (CUP) is to use …


Efficient Parallel Computation On Multiprocessors With Optical Interconnection Networks, Min He Jan 2002

Efficient Parallel Computation On Multiprocessors With Optical Interconnection Networks, Min He

LSU Doctoral Dissertations

This dissertation studies optical interconnection networks, their architecture, address schemes, and computation and communication capabilities. We focus on a simple but powerful optical interconnection network model - the Linear Array with Reconfigurable pipelined Bus System (LARPBS). We extend the LARPBS model to a simplified higher dimensional LAPRBS and provide a set of basic computation operations. We then study the following two groups of parallel computation problems on both one dimensional LARPBS's as well as multi-dimensional LARPBS's: parallel comparison problems, including sorting, merging, and selection; Boolean matrix multiplication, transitive closure and their applications to connected component problems. We implement an optimal …