Back to search

NJIT

Multistage interconnection networks : improved routing algorithms and fault tolerance

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Electrical Engineering - (M.S.)
Discipline thesis:degree_discipline
Electrical and Computer Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Chen, Kuo-Yu
Contributors dc:contributor
  • John D. Carpinelli
  • Anthony D. Robbi
  • Sotirios Ziavras

Subjects

dc:subject × 4

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/1291

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Chen, Kuo-Yu. Multistage interconnection networks : improved routing algorithms and fault tolerance. https://digitalcommons.njit.edu/theses/1291