International Conference on Parallel Processing A COMPARISON BASED PARALLEL SORTING ALGORITHM *
International Conference on Parallel Processing A COMPARISON BASED PARALLEL SORTING ALGORITHM *
复制标题
DOI：
--
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
Laxmikant;Kale Sanjeev
中科院分区：
文献类型：
--
作者：
Laxmikant;Kale Sanjeev
我们提出o快速的comportson h s c d pomllel soltrng dporithrn fhot可以处理r b i t m y键类型。 dofo movcmrnt是大多数olgurithma fitemdum中大多数olgurithma的主要部分。我们的算法1S PrometerAzuf，以便可以调整RT以控制数据movcmcnt trrnc，sspCrrdly，以控制大型数据集。平行的矿石矿石使用了钥匙aet extcrectlv。该算法是Artrtectum tndeptntent。并已实施TN魅力Portoblc Pomllel编程系统，从而可以在任何EDIMD计算机上对其进行调整。 pcrjomancc〜s u l：＃用于对Diflerent Aura集进行排序。
We present o fast comportson h s c d pomllel sortrng dporithrn fhot can handle a r b i t m y key types. Dofo movcmrnt is the major portion o j sorttng tame for most olgurithma In the litemdum. Our algorithm 1s prometerazuf so that rt can be tuned to control data movcmcnt trrnc, sspcrrdlyfor large data sets. Parallelhtatogmm ore used lo p r l r l r o n the key aet exactlv. The algorithm is archrtectum tndeptndent. and has been implemented tn the CHARM portoblc pomllel programming system, allowing it to be cficrcntly tun on vtrfually any EdIMD computer. Pcrjomancc ~ s u l : # for sorting diflerent aura sets are presented.