Parallel sorting in a ring network of processors
Journal Article
·
· IEEE Trans. Comput.; (United States)
Selection sorting algorithms, e.g, heapsort, require O(Nlog (N)) comparisons to sort N items. Parallel versions of these algorithms have been developed, using a linear array of O(log(N)) processors. Such schemes overlap O(log(N)) comparisons at a time and can sort N items in O(N) time. This paper presents a parallel implementation that uses a ring-connected array of processors, in which each processor has the same amount of memory. Uniformity in the size of the memories provides advantages from the viewpoint of manufacture, maintenance, inventory, item placement, and many other aspects of system design. These memories can, together, function as an interleaved memory for a general-purpose computer.
- Research Organization:
- Dept. of Mathematics and Computer Science, Univ. of California, Riverside, CA (US)
- OSTI ID:
- 6243196
- Journal Information:
- IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. 38:3; ISSN ITCOB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimal parallel merging and sorting without memory conflicts
Cost-optimal parallel algorithms for constructing 2-3 trees
Some parallel sorts on a mesh-connected processor array and their time efficiency
Journal Article
·
Sat Oct 31 23:00:00 EST 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5912451
Cost-optimal parallel algorithms for constructing 2-3 trees
Journal Article
·
Thu Feb 28 23:00:00 EST 1991
· Journal of Parallel and Distributed Computing; (United States)
·
OSTI ID:5001516
Some parallel sorts on a mesh-connected processor array and their time efficiency
Journal Article
·
Mon Sep 01 00:00:00 EDT 1986
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:6849179