An efficient parallel sorting compatible with the standard qsort

DOI10.1142/S0129054111008568MaRDI QIDQ3173935zbMATH OpenFDO

Authors Duhu Man, Yasuaki Ito, Koji Nakano

Publication date 10 October 2011

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054111008568

zbMATH Keywords

sortingmulticore processor\texttt{psort}\texttt{qsort}C standard libraryloading balance

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• An efficient parallel sorting algorithm for shared memory multiprocessors
• An efficient parallel sorting algorithm
• Parallel sorting by regular sampling
• A parallel sorting-merging algorithm for tightly coupled multiprocessors
• On the versatility of parallel sorting by regular sampling

Cites work

• scientific article; zbMATH DE number 4074508 (Why is no real title available?)
• A benchmark parallel sort for shared memory multiprocessors
• A randomized parallel sorting algorithm with an experimental study
• Fast parallel GPU-sorting using a hybrid algorithm
• Parallel merge sort with load balancing
• Partitioned parallel radix sort

Describes a project that uses

Uses Software

• GPUTeraSort

This page was built for publication: An efficient parallel sorting compatible with the standard qsort

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173935)