Engineering Commons^™

Improving The Run Time Of The Decomposition Algorithm For Fault Tolerant Clos Interconnection Networks Through Swap Re-Ordering, Andrea Laura Mcmakin

Theses

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 …

Efficient Multiprocessor Scheduling Based On Genetic Algorithms, Hong Ren

Theses

The problem of multiprocessor scheduling can be stated as finding a schedule for a general task graph to be executed on a multiprocessor system so that the schedule length can be minimized. This scheduling problem in known to be NP-hard and methods based on heuristic search have been proposed to obtain optimal and sub-optimal solutions to the problem. Genetic algorithms have recently received much attention as robust stochastic searching algorithms for various optimization problems. In this thesis, we propose an efficient method based on genetic algorithms to solve the multiprocessor scheduling problem. The representation of the search node will be …

Parallel Implementation Of Spatial Domain Image Processing Algorithms On The Mesh Connected Computer Simulator, Adury Devi Prasad

Theses

The performance of conventional computers in image processing applications is known to be inadequate due to the enormous computational requirements. Almost all image processing applications can be implemented in parallel. This thesis is the parallel implementation of neighborhood averaging and edge detection by the Sobel and Laplacian operators on the Mesh Connected Computer Computer Simulator (MCCS), a package developed at NJIT to study the behavior of SIMD machines. Expressions for speedup, utilization and efficiency have been derived. Suggestions for further improvements that can be incorporated in MCCS and its instruction set have been made.

Fault Tolerant Clos Network, Preet Mohan S. Ahluwalia

Theses

Multistage interconnection networks, or MINs, provide paths between functional modules in multiprocessor systems. The MINs are usually segmented into several stages. Each stage connects inputs to appropriate links of the next stage so that the cumulative effect of all the stages satisfies input-output connection requirements.

This thesis deals with a fault tolerant Clos network. The fault tolerance technique involves addition of extra switches per stage to compensate for any switch failure The reliability analysis of both ordinary and fault tolerant Clos networks is presented. The optimal number of extra switches required to get the best reliability results has been analyzed.