| 在SIMD－EREW计算模型上的并行排序算法 |
| |
| 引用本文： | 陈崚.在SIMD－EREW计算模型上的并行排序算法[J].中国科学技术大学学报,1994(2). |
| |
| 作者姓名： | 陈崚 |
| |
| 作者单位： | 扬州师范学院数学系 |
| |
| 摘 要： | 本文提出一种在ＳＩＭＤ－ＥＲＥＷ计算模型上实现的并行排序算法．算法采用基数交换排序方法，在处理过程中无存贮访问冲突．对长度为ｎ的序列，算法使用不超过个处理单元，时间复杂度为Ｏ（ｕ．ｌｏｇ２ｎ），其中ｕ为不超过处理器字长的常数．该算法适合于具有较多重复元素的序列排序．
|
| 关 键 词： | 排序，SIMD－EREW计算模型，并行算法 |
A Parallel Algorithm for Sorting on SIMD-EREW |
| |
| Chen Ling.A Parallel Algorithm for Sorting on SIMD-EREW[J].Journal of University of Science and Technology of China,1994(2). |
| |
| Authors: | Chen Ling |
| |
| Institution: | Yakgzhou Teachers'College |
| |
| Abstract: | A parallel sorting alsorthm on SIMD-EREW is presented. The algorithm is based on theradix exchange sorting metnod and is without memory access conflict. For a sequence with n elements,the algorithm meeds no more than n processors. The time complexity is O(u. logn), with u being aconstant not greater than the word length of the processor, The algorithm is very efficient when the sequence has many duplicate elements. |
| |
| Keywords: | sorting SIMD-EREW parallel algorithm |
| 本文献已被 CNKI 等数据库收录！ |
