Document Type
Thesis
Date of Award
Spring 5-31-1991
Degree Name
Master of Science in Electrical Engineering - (M.S.)
Department
Electrical and Computer Engineering
First Advisor
John D. Carpinelli
Second Advisor
Anthony D. Robbi
Third Advisor
Sotirios Ziavras
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.
Recommended Citation
Chen, Kuo-Yu, "Multistage interconnection networks : improved routing algorithms and fault tolerance" (1991). Theses. 1291.
https://digitalcommons.njit.edu/theses/1291
