Engineering Commons^™

Algorithms For The Njit Turbonet Parallel Computer, Nitin J. Lad

Theses

Element selection for arrays, array merging, and sorting are very frequent operations in many of today's important applications. These operations are of interest to scientific, as well as other applications where high-speed database search, merge, and sort operations are necessary and frequent. Therefore, their efficient implementation on parallel computers should be a worthwhile objective. Parallel algorithms are presented in this thesis for the implementation of these operations on the NET TurboNet system, an in-house built experimental parallel computer with TMS320C40 Digital Signal Processors interconnected in a 3-D hypercube structure. The first algorithm considered is selection. It involves finding the k-th …