Analysis of the performance of the parallel quicksort method (Q1070824)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Analysis of the performance of the parallel quicksort method |
scientific article; zbMATH DE number 3938578
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of the performance of the parallel quicksort method |
scientific article; zbMATH DE number 3938578 |
Statements
Analysis of the performance of the parallel quicksort method (English)
0 references
1985
0 references
This paper deals with the quicksort algorithm and its performance on a parallel MIMD computer. Using the analysis of the quicksort algorithm by Knuth and Sedgewick the authors derive approximations for the speed up ratio for a varying number of processors and a varying size of the small subfiles which are finally sorted by some insertion sort. The theoretical estimates are rather rough compared to the results of the experiments and the theoretically derived speed up rate is considerably higher than the experimentally achieved result. However the tendency is the same and the results presented can constitute a starting point for more appropriate estimates.
0 references
parallel computation
0 references
partitioning process
0 references
linear insertion
0 references
quicksort algorithm
0 references
performance on a parallel MIMD computer
0 references
speed up rate
0 references
