Efficient massively parallel quicksort

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1253, Issue , 1997, Pages 13-24

  Sanders, Peter ^a   Hansch, Thomas ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Implementation of parallel quicksort; Irregular communication patterns; Locality preserving indexing schemes; LooA balancing; Sorting with multiple pivots

Indexed keywords

INDEXING (OF INFORMATION);

ASYMPTOTICALLY OPTIMAL; COMMUNICATION PATTERN; LOCALITY PRESERVING INDEXING; LOCALITY-PRESERVING; MASSIVELY PARALLELS; OPTIMIZED ALGORITHMS; PARALLEL SORTING ALGORITHMS; QUICKSORT;

PARALLEL PROCESSING SYSTEMS;

EID: 84947809502     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63138-0_2     Document Type: Conference Paper

References (16)

1. D. Bailey, E. Barszcz, J. Barton, D. Browning, and R. Carter. The NAS parallel benchmarks. Technical Report RNR-94-007, RNR, 1994.
2. G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha. A comparison of sorting algorithms for the connection machine CM-2. In A CM Symposium on Parallel Architectures and Algorithms, pages 3-16, 1991.
3. R. Butenuth, W. Burke, and H.-U. Heiß. Cosy - an operating system for highly parallel computers. A CM Operating Systems Review, 30(2):81-91, 1996.
4. R. Diekmarm, J. Gehring, R. Lüling, B. Monien, M. Nüibel, and R. Wanka. Sorting large data sets on a massively parallel system. In 6th IEEE Symposium on Parallel and Distributed Processing, pages 2-9, 1994.
5. S. Goil, S. Aluru, and S. Ranka. Concatenated parallelism: A techxfique for efficient parallel divide and conquer. In Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing, pages 488-495, 1996.
6. J. Hardwick. An efficient implementation of nested data parallelism for irregurlar divide-and-conquer algorithms. In Workshop on High-Level Programming Models and Supportive Environments, Honolulu, Hawaii, 1996.
7. W. L. Hightower, J. F. Prins, and J. H. Reif. Implementations of randomized sorting on large parallel machines. In ACM Symposium on Parallel Architectures and Algorithms, pages 158-167, 1992.
8. V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing. Design and Analysis of Algorithms. Benjamin/Cummings, 1994.
9. H. Li and K. C. Sevcik. Parallel sorting by overpartitioning. In ACM Symposium on Parallel Architectures and Algorithms, pages 46-56, Cape May, New Jersey, 1994.
10. R. Niedermeier and P. Sanders. On the Manhattan-distance between points on space-filling mesh-indexings. Technical Report IB 18/96, Universits Karlsruhe, Fakultä für Informatik, 1996.
11. M. J. Quinn. Analysis and benchmarking oaf two parallel sorting algorithms: hyperquicksort and quickmerge. BIT, 25:239-250, 1989.
12. S. Rajasekaran and S. Sen. Random sampling techniques and parallel algorithm design. In H. Reif, editor, Synthesis of Parallel Algorithms, chapter 9, pages 411-451. Morgan KaufmaIm, 1993.
13. P. Sanders. A scalable parallel tree search library. In S. Ranka, editor, 2nd Workshop on Solving Irregular Problems on Distributed Memory Machines, Honolulu, Hawaii, 1996.
14. P. Sanders. Randomized priority queues for fast parallel access. Technical Report IB 7/97, Universits Karlsruhe, Fakultä für Informatik, 1997.
15. V. Singh, V. Knmar, G. Agha, and C. Tomlinson. Efficient algorithms for parallel sorting on mesh multicomputers. International Journal of Parallel Programming, 20(2):95-131, 1991.
16. T. Umland. Parallel sorting revisited. Parallel Computing, 20(1):115-124, 1994.