论文信息 - Combining digital access and parallel partition for quicksort and quickselect

Combining digital access and parallel partition for quicksort and quickselect

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.

Jordi Petit | Leonor Frias | Jordi Petit | Leonor Frias

[1] Yi Zhang,et al. A simple, fast parallel implementation of Quicksort and its performance evaluation on SUN Enterprise 10000 , 2003, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings..

[2] Roberto Grossi,et al. Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures , 1999, ICALP.

[3] Roberto Grossi,et al. Search Data Structures for Skewed Strings , 2003, WEA.

[4] M. Chial,et al. in simple , 2003 .

[5] Peter Sanders,et al. MCSTL: the multi-core standard template library , 2007, PPOPP.

[6] Rhys S. Francis,et al. A parallel partition for enhanced parallel QuickSort , 1992, Parallel Comput..

[7] Roberto Grossi,et al. A General Technique for Managing Strings in Comparison-Driven Data Structures , 2004, ICALP.

[8] Jon Louis Bentley,et al. Engineering a sort function , 1993, Softw. Pract. Exp..

[9] Thierry Gautier,et al. Deque-Free Work-Optimal Parallel STL Algorithms , 2008, Euro-Par.

[10] Salvador Roura. Digital Access to Comparison-Based Tree Data Structures and Algorithms , 2001, J. Algorithms.

[11] Justin Zobel,et al. Cache-conscious sorting of large sets of strings with dynamic tries , 2004, JEAL.

[12] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .

[13] Jordi Petit,et al. Parallel Partition Revisited , 2008, WEA.