【摘要】 Multisets排序是指对具有k个不同关键字的n个数据进行排序(0<k<n)。本文提出一种在分布存储计算机系统、基于消息传递环境下,以加法运算为基础的稳定的归并并行算法,该算法实现对Multisets的排序,其时间复杂度为O(n/p log P+k log p+4p+n/2)。更多还原

【Abstract】 Sorting for multisets is to sort n elements that contain only k distinct key values, where 0<k<n. In this paper, a stable algorithm is offered for multisets sorting in distributed-memory parallel systems. Its time complexity is 0(n/p log p+ k log p+4p+n/2).更多还原