A Parallel Processing Method of Divide-and-Conquer and a Highly Efficient Parallel Sorting Algorithm

摘要：

With the rapid development of parallel processing, the research of parallel processing methods of general algorithm design techniques such as divide-and-conquer becomes more and more significant. This paper discusses a parallel processing method of divide-and-conquer and its applications to sorting operations on cubes. It derives a highly efficient parallel sorting algorithm that can achieve asymptotically suboptimal O(log2 n)=O(log2 p) running time when n =p.This new parallel sorting algorithm is presently one of the fastest practical deterministic sorting algorithms available.

关键词： parallel processing general algorithm design techniques divide-and-conquer cubes the parallel sorting algorithm

作者: Minghe Huang Cuixiang Zhong Liping Dai Gang Lei

作者单位: Software Engineering College, Jiangxi Normal University Nanchang, Jiangxi, 330022, China

会议类型: 国际会议

会议名称: 2006 International Symposium on Distributed Computing and Applications to Business,Engineering and Science(2006年国际电子、工程及科学领域的分布式计算应用学术研讨会)

会议地点: 杭州

会议语种:英文

页码: 86-88

在线出版日期: 2006-10-12（万方平台首次上网日期，不代表论文的发表时间）