Abstract
dc:description.abstract<p>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.</p><p>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.</p>
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
-
- Calidas, Venkatraman U.
- Contributors dc:contributor
-
- John D. Carpinelli
- Anthony D. Robbi
- Edwin Hou
Subjects
dc:subject × 3Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.njit.edu/theses/2535