Multistage interconnection networks : Improved routing algorithms and fault tolerance
Department of Electrical and Computer Engineering
Master of Science
Carpinelli, John D.
Robbi, Anthony D.
Computer Network Architectures
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 Bene and Clos networks as well as the fault tolerant capability. The permutation representation is examined as well as the Clos and Bene 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 Bene networks. A new fault tolerant Clos network is presented.
njit-etd1991-011 (74 pages ~ 3,181 KB pdf)
Please complete this Feedback Form to inform us about your experience using this website. It will assist us in better serving your information needs in the future. Thank You!
If you have any questions please contact the Digital Projects Librarian
Created October 1, 2001