TY  - JOUR
T1  - An Efficient Approach for Handling Large Arrays in Parallelh Computing Environment Using Bitonic Sorting
AU - , Ahmed Shamsul Arefin AU - , Muhammad Arifur Rahman AU - , Mohmmad Mamun Kabir AU - , Abu MD Zafor Alam AU - , Shamim Al Mamun AU - , M. Lutfar Rahman 
JO  - Asian Journal of Information Technology
VL  - 4
IS  - 11
SP  - 1027
EP  - 1030
PY  - 2005
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2005.1027.1030
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2005.1027.1030
KW  - Bitonic sorting
KW  -SIMD
KW  -hypercube
KW  -distributed computer
KW  -parallel algorithm
AB  - In this study 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.
ER  -