Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Theory and Algorithms
Shared Memory, Message Passing, And Hybrid Merge Sorts For Standalone And Clustered Smps, Atanas Radenski
Shared Memory, Message Passing, And Hybrid Merge Sorts For Standalone And Clustered Smps, Atanas Radenski
Mathematics, Physics, and Computer Science Faculty Books and Book Chapters
While merge sort is well-understood in parallel algorithms theory, relatively little is known of how to implement parallel merge sort with mainstream parallel programming platforms, such as OpenMP and MPI, and run it on mainstream SMP-based systems, such as multi-core computers and multi-core clusters. This is misfortunate because merge sort is not only a fast and stable sort algorithm, but it is also an easy to understand and popular representative of the rich class of divide-and-conquer methods; hence better understanding of merge sort parallelization can contribute to better understanding of divide-and-conquer parallelization in general. In this paper, we investigate three …