The New Jersey Institute of Technology's
Electronic Theses & Dissertations Project

Title:	Multistage interconnection networks : improved routing algorithms and fault tolerance
Author:	Chen, Kuo-Yu
View Online:	njit-etd1991-011 (vi, 63 pages ~ 3.1 MB pdf)
Department:	Department of Electrical and Computer Engineering
Degree:	Master of Science
Program:	Electrical Engineering
Document Type:	Thesis
Advisory Committee:	Carpinelli, John D. (Committee chair) Robbi, Anthony D. (Committee member) Ziavras, Sotirios (Committee member)
Date:	1991-05
Keywords:	Computer Network Architectures Fault-Tolerant Computing Computer Algorithms
Availability:	Unrestricted
Abstract:	Multistage interconnection networks for use by multiprocessor systems are optimal in terms of the number of switching element, but the routing algorithms used to set up these networks are suboptimal in terms of time. The network set-up time and reliability are the major factors to affect the performance of multistage interconnection networks. This work improves routing on Benes and Clos networks as well as the fault tolerant capability. The permutation representation is examined as well as the Clos and Benes networks. A modified edge coloring algorithm is applied to the regular bipartite multigraph which represents a Clos network. The looping and parallel looping algorithms are examined and a modified Tree-Connected Computer is adopted to execute a bidirectional parallel looping algorithm for Benes networks. A new fault tolerant Clos network is presented.