1. Sorting on an array of processors
- Author
-
H.V. Jagadish
- Subjects
MIMD ,Sorting algorithm ,Sparse array ,Computer science ,Sorted array ,Asynchronous array of simple processors ,Sorting ,Parallel algorithm ,Array data structure ,Hashed array tree ,Algorithm design ,Parallel computing ,External sorting - Abstract
The author presents a practical sorting algorithm for a nearest-neighbor connected array of MIMD (multiple-instruction, multiple-data-stream) processors, each handling a significant fraction of the elements to be sorted. The algorithm is communication and CPU-optimal for a linear array, is almost order-preserving, and requires little working memory. >
- Published
- 2003