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

Title:	Improving the run time of the decomposition algorithm for fault tolerant Clos interconnection networks through swap re-ordering
Author:	McMakin, Andrea Laura
View Online:	njit-etd1998-027 (xiii, 92 pages ~ 2.9 MB pdf)
Department:	Department of Electrical and Computer Engineering
Degree:	Master of Science
Program:	Computer Engineering
Document Type:	Thesis
Advisory Committee:	Carpinelli, John D. (Committee chair) Zhou, MengChu (Committee member) Hou, Edwin (Committee member)
Date:	1998-08
Keywords:	Computer networks--Equipment and supplies Data transmission systems Computer algorithms
Availability:	Unrestricted
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.