Parallel Quicksort Using Fetch-And-Add
IEEE Transactions on Computers
An introduction to parallel algorithms
An introduction to parallel algorithms
The NYU ultracomputer—designing a MIMD, shared-memory parallel machine
25 years of the international symposia on Computer architecture (selected papers)
Introduction to Algorithms
Introduction to Parallel Computing
Introduction to Parallel Computing
A cost optimal parallel quicksorting and its implementation on a shared memory parallel computer
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
MCSTL: the multi-core standard template library
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Combining digital access and parallel partition for quicksort and quickselect
IWMSE '09 Proceedings of the 2009 ICSE Workshop on Multicore Software Engineering
| Hi-index | 0.00 |
In this paper we consider parallel algorithms to partition an array with respect to a pivot. We focus on implementations for current widely available multi-core architectures. After reviewing existing algorithms, we propose a modification to obtain the minimal number of comparisons. We have implemented these algorithms and drawn an experimental comparison.