A comparative study of parallel sort algorithms

Authors:
Davide Pasetto;Albert Akhriev
Affiliations:
IBM Dublin Research Lab, Dublin, Ireland;IBM Dublin Research Lab, Dublin, Ireland
Venue:
Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion
Year:
2011

Citing 3
Cited 0

Merging multiple lists on hierarchical-memory multiprocessors

Journal of Parallel and Distributed Computing - Special issue on shared-memory multiprocessors
Parallelizing fundamental algorithms such as sorting on multi-core processors for EDA acceleration

Proceedings of the 2009 Asia and South Pacific Design Automation Conference
MCSTL: the multi-core standard template library

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.