Communication-space efficient parallel Bitonic sorting on Symmetric Multiprocessors

Authors:
Tipraporn Thanakulwarapas;Jeeraporn Werapun
Affiliations:
King Mongkut's Institute of Technology at Ladkrabang (KMITL), Ladkrabang, Bangkok, Thailand;King Mongkut's Institute of Technology at Ladkrabang (KMITL), Ladkrabang, Bangkok, Thailand
Venue:
ACST '08 Proceedings of the Fourth IASTED International Conference on Advances in Computer Science and Technology
Year:
2008

Citing 7
Cited 0

Using MPI: portable parallel programming with the message-passing interface

Using MPI: portable parallel programming with the message-passing interface
A sorting algorithm on a PC cluster

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Minimizing Communication in the Bitonic Sort

IEEE Transactions on Parallel and Distributed Systems
Optimizing Parallel Bitonic Sort

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Communication-Efficient Bitonic Sort on a Distributed Memory Parallel Computer

ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
A New Parallel Sorting Algorithm based on Odd-Even Mergesort

PDP '07 Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing
Sorting networks and their applications

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new efficient data-exchange process in parallel sorting, which improves both communication time and memory space. In this communication-space efficient strategy, we proposed two new parallel sorting algorithms: 1) CSEBS (Communication-Space Efficient Bitonic Sort) algorithm and 2) CSEOE (Communication-Space Efficient Odd-Even MergeSort) algorithm. In addition, to evaluate the performance, we have implemented the CSEBS and the CSEOE algorithms on the SGI Origin2000. Investigated experimental results have been compared to those of the best of existing algorithm (CEBS: Communication Efficient Bitonic Sort). In the experiments, the proposed CSEBS algorithm yielded the improved results over those of the best of existing algorithm (CEBS) at least 11% on the system of size P = 4 and at least 31% on the system of size P = 8. Moreover our approach can save memory space up to 50%.