Document Type
Thesis
Date of Award
9-30-1990
Degree Name
Master of Science in Electrical Engineering - (M.S.)
Department
Electrical and Computer Engineering
First Advisor
John D. Carpinelli
Second Advisor
Anthony D. Robbi
Third Advisor
Edwin Hou
Abstract
Many sorting algorithms, such as the bubble sort and the binary tree selection sort, are n-squared algorithms and take O (n2) time to sort n values. These can be easily parallelized; the resulting sorts are called the odd-even transposition sort and the parallel tree selection sort, respectively. These have O(nlogn) time complexity. The quicksort is an O(nlogn) algorithm and it can parallelized to make it an O(logn) algorithm.
A transputer is a microprocessor which has serial links to transmit and receive data from other transputers. The above algorithms are implemented on a network of transputers and the link connections for the topology for each algorithm is suggested. The hardware and software tools available for this thesis enabled us to implement the above parallel sorting algorithms.
Recommended Citation
Calidas, Venkatraman U., "Implementation of parallel sorting algorithms on a transputer network" (1990). Theses. 2535.
https://digitalcommons.njit.edu/theses/2535
