摘要： 研究并实现了在LS-SIMD计算机上基于奇偶比较方法的按行或按列数据并行排序算法,并对算法的计算复杂性和通信复杂性进行了分析。该研究对于扩展LS SIMD计算机在非数值计算方面的应用有着十分重要的实际意义。
关键词:
SIMD,
奇偶比较交换,
处理元阵列
Abstract: Based on the structure of LS SIMD computer, this paper mainly discusses a sorting algorithm by the method of even-odd transpositions, and analyzes the computation complexity and communication complexity of this algorithm. It is important to extend the application of LS SIMD computer in non -numeric computation area.
中图分类号:
王馨梅,张翔,张发存,崔杜武. 基于LS-SIMD的奇偶比较交换排序算法[J]. , 2004, 30(13): 56-.
WANG Xinmei, ZHANG Xiang, ZHANG Facun, CUI Duwu. A Sorting Algorithm by Even-odd Transpositions Based on LS-SIMD[J]. , 2004, 30(13): 56-.