Back to results

NJIT

Improving the run time of the decomposition algorithm for fault tolerant Clos interconnection networks through swap re-ordering

Abstract

dc:description.abstract

Clos interconnection networks, used in data networks and computing systems, can contain extra switches to be used in faulty conditions. The speed of such fault tolerant Clos interconnection networks is improved through the use these switches in no-fault situations. The network can be represented by a matrix, which is then decomposed using an algorithm, and the switch settings are thus assigned. The original decomposition algorithm consisted of four element swaps in the following order: wild swap, simple swap, next simple swap, and successive swap. However, by re-arranging these swaps with the simple swap first, followed by the next simple and successive swaps with the wild swap coming either before or after the next simple, the number of total swaps needed to fully decompose the matrix is significantly reduced.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • McMakin, Andrea Laura
Contributors dc:contributor
  • John D. Carpinelli
  • MengChu Zhou
  • Edwin Hou

Subjects

dc:subject × 4

Identifiers

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

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

McMakin, Andrea Laura. Improving the run time of the decomposition algorithm for fault tolerant Clos interconnection networks through swap re-ordering. https://digitalcommons.njit.edu/theses/909