Combining digital access and parallel partition for quicksort and quickselect

Authors:
Leonor Frias;Jordi Petit
Affiliations:
Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Spain;Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Spain
Venue:
IWMSE '09 Proceedings of the 2009 ICSE Workshop on Multicore Software Engineering
Year:
2009

Citing 7
Cited 0

Engineering a sort function

Software—Practice & Experience
Digital access to comparison-based tree data structures and algorithms

Journal of Algorithms
Introduction to Algorithms

Introduction to Algorithms
Cache-conscious sorting of large sets of strings with dynamic tries

Journal of Experimental Algorithmics (JEA)
Search data structures for skewed strings

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Parallel partition revisited

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
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 combine digital access to strings with parallel partition to enhance parallel quicksort and quickselect implementations. Previously, digital access had only been combined with sequential comparison-based algorithms and data structures. We present broadly our approach, not only algorithmically but from the design and implementation point of view. Finally, we give some experimental results that indicate its effectiveness in practice.