A parallel sorting scheme whose basic operation sorts n elements
Journal Article
·
· Int. J. Comput. Inf. Sci.; (United States)
Batcher proposed a parallel sorting scheme whose basic operation sorts two elements. Tseng and Lee extended his results. They proposed a parallel sorting scheme whose basic operation sorts three elements. In this paper, we propose a parallel sorting scheme whose basic operation sorts n elements where n is an arbitrary number. The correctness of this algorithm is given.
- Research Organization:
- National Chiao Tung Univ., Hsinchu
- OSTI ID:
- 7043748
- Journal Information:
- Int. J. Comput. Inf. Sci.; (United States), Journal Name: Int. J. Comput. Inf. Sci.; (United States) Vol. 14:6; ISSN IJCIA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel enumeration sorting scheme for VLSI
Some parallel sorts on a mesh-connected processor array and their time efficiency
Optimal parallel sorting scheme by order statistics
Journal Article
·
Tue Nov 30 23:00:00 EST 1982
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6153406
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
Optimal parallel sorting scheme by order statistics
Journal Article
·
Mon Nov 30 23:00:00 EST 1987
· SIAM J. Comput.; (United States)
·
OSTI ID:5496956