Bitonic sort with an arbitrary number of keys

B.-F. Wang; G.-H. Chen; C.-C. Hsu

Back

Conference paper

Bitonic sort with an arbitrary number of keys

B.-F. Wang, G.-H. Chen and C.-C. Hsu

International Conference on Parallel Processing, Vol.3, p.58

1991

Abstract

Bitonic sort;arbitrary number of keys

The previous implementation of bitonic son on the hypercube requires the number of input keys to be a power of 2. For sorting an arbitrary number of keys, one commmon way is to add dummy keys with maximal values to the end of the input to make ihe total number of keys a power number of 2.

Metrics

1 Record Views

Details

Title: Bitonic sort with an arbitrary number of keys
Creators - without role: B.-F. Wang - 國立清華大學電機資訊學院資訊工程學系
G.-H. Chen
C.-C. Hsu
Publication Details: International Conference on Parallel Processing, Vol.3, p.58
Identifiers: 9957771230806774
Academic Unit: Department of Computer Science, College of Electrical Engineering and Computer Science, National Tsing Hua University
Language: Traditional Chinese
Resource Type: Conference paper

Bitonic sort with an arbitrary number of keys

Abstract

Related links

Metrics

Details

National Tsing Hua University Social media