An improvement of Bitonic sorting for parallel computing

Authors:
Ahmed Shamsul Arefin;Mohammed Abul Hasan
Affiliations:
Faculty of Science & IT, Daffodil International University, Dhaka, Bangladesh;Department of Computer Science, Information Valley of IIT, Dhaka, Bangladesh
Venue:
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Year:
2005

Citing 3
Cited 1

Adaptive bitonic sorting: an optimal parallel algorithm for shared-memory machines

SIAM Journal on Computing
Sorting on a mesh-connected parallel computer

Communications of the ACM
Efficient Oblivious Parallel Sorting on the MasPar MP-1

HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Software Technology and Architecture - Volume 1

Parallel implementation of external sort and join operations on a multi-core network-optimized system on a chip

ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we would like to introduce an efficient variant of Bitonic sorting that can be used with sorting large arrays in distributed computing environment. The problem of sorting a collection of values on a mesh-connected distributed-memory computer using our sort algorithm is considered for the case where the number of values exceeds the number of processors in the machine. In this setting the number of comparisons can be reduced asymptotically if the processors have addressing autonomy (locally indirect addressing), and communication costs can be reduced by careful placement of the data values.