Paper Info
Title
A comparative study of parallel sort algorithms
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.
Year
DOI
Venue
2011
10.1145/2048147.2048207
OOPSLA Companion
Keywords
Field
DocType
database record,comparative study,modern multi-core hardware,brief analysis,particular interest,huge array,parallel sort algorithm,general-purpose method,scalability
Computer science,Parallel computing,Theoretical computer science,Sorting,Parallel sorting,Bitonic sorter,Sorting algorithm,Scalability
Conference
Citations 
PageRank 
References 
5
0.56
4
Authors
2
Name
Order
Citations
PageRank
Davide Pasetto116311.77
Albert Akhriev263.99