快速排序算法的效率相对较高,并行算法在理想的情况下时间复杂度可达到o(n),但并行快速排序算法有一个严重的问题:会造成严重的负载不平衡,最差情况下算法的复杂度可达o(n^2)。本篇我们介绍一种基于均匀划分的负载平衡的并行排序算法---并行正则采样排序(Parallel Sorting by Regular Sampling)。 一、算法的基本思想...
ParallelProgramming inCwithMPIandOpenMP MichaelJ.Quinn Chapter14 Sorting Outline Sortingproblem Sequentialquicksort Parallelquicksort Hyperquicksort Parallelsortingbyregularsampling SortingProblem Permute:unorderedsequenceorderedsequence Typicallykey(valuebeingsorted)ispartofrecordwithadditionalvalues(satellitedata) ...
SortingproblemSequentialquicksortParallelquicksortHyperquicksortParallelsortingbyregularsampling Copyright©TheMcGraw-HillCompanies,Inc.Permissionrequiredforreproductionordisplay.Copyright©TheMcGraw-HillCompanies,Inc.Permissionrequiredforreproductionordisplay.Copyright©TheMcGraw-HillCompanies,Inc.Permissionrequiredfor...
Sorting is one of the most common and most im- portant problems in the field of computer science. Parallel sorting has become very necessary in order to reduce the com- putation time for HPC applications which uses parallel sorting in each iteration. In this paper we present an approach to...