| 基于Java的按位拆分快速排序并行算法 |
| |
| 引用本文： | 庹清,宋耀虎. 基于Java的按位拆分快速排序并行算法[J]. 计算机应用, 2012, 32(9): 2455-2457. DOI: 10.3724/SP.J.1087.2012.02455 |
| |
| 作者姓名： | 庹清 宋耀虎 |
| |
| 作者单位： | 1.吉首大学 城乡资源与规划学院,湖南 张家界 427000;2.吉首大学 数学与统计学院,湖南 吉首 416000 |
| |
| 基金项目： | 国家自然科学基金资助项目(11101186);湖南省教育厅科学研究基金资助项目(08A057);吉首大学博士基金资助项目(201101) |
| |
| 摘 要： | 针对大数据量排序算法优化问题,提出一种基于Java的按位拆分的排序新算法。该排序算法按照位拆分数据,并结合Java的多线程对拆分的数据进行并行处理。数据实验结果表明,对于大数据量排序,该算法性能明显优于快速排序算法,而且算法具有很好的并行效率。
|
| 关 键 词： | 按位拆分 快速排序 并行算法 数据实验 算法分析 |
| 收稿时间： | 2012-03-13 |
| 修稿时间： | 2012-05-15 |
Bit-split parallel algorithm for quick sorting based on Java |
| |
| TUO Qing,SONG Yao-hu. Bit-split parallel algorithm for quick sorting based on Java[J]. Journal of Computer Applications, 2012, 32(9): 2455-2457. DOI: 10.3724/SP.J.1087.2012.02455 |
| |
| Authors: | TUO Qing SONG Yao-hu |
| |
| Affiliation: | 1.College of Urban and Rural Resources and Planning,Jishou University,Zhangjiajie Hunan 427000,China;
2.College of Mathematics and Statistics,Jishou University,Jishou Hunan 416000,China |
| |
| Abstract: | This paper presented a new sorting algorithm based on bit-split quick sort that aimed to explore the algorithm which had excellent performance for large data.The algorithm split data in bit,and parallel processed the split data in combination with Java’s concurrent mechanism.The data experiments show that the new sorting algorithm is significantly better than quick sort for large data sorting and owns very good parallel efficiency. |
| |
| Keywords: | bit-split quick sort parallel algorithm data experiment algorithm analysis |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
