A comparative study of parallel sort algorithms
D Pasetto, A Akhriev - Proceedings of the ACM international conference …, 2011 - dl.acm.org
D Pasetto, A Akhriev
Proceedings of the ACM international conference companion on Object oriented …, 2011•dl.acm.org… The lack of comparative studies has driven our interest to hardwarefriendly sorting
algorithms. In this research we try to shed some light on hardware specific restrictions that
can make an algorithm to perform poorly even though it is theoretically efficient. This study
focuses on general-purpose sorting of huge arrays. The data-specific …
algorithms. In this research we try to shed some light on hardware specific restrictions that
can make an algorithm to perform poorly even though it is theoretically efficient. This study
focuses on general-purpose sorting of huge arrays. The data-specific …
In this paper we examine the performance of parallel sorting algorithms on modern multi-core hardware. Several general-purpose methods, with particular interest in sorting of database records and huge arrays, are evaluated and a brief analysis is provided.
ACM Digital LibraryShowing the best result for this search. See all results
