多点并行查找和排序算法及实现

The Algorithms and Implementations of Multi-Point Parallel Searching and Sorting

针对串行查找和排序效率低,相联方法成本高的缺点,本文提出了多点并行法。该法基于没置数量可选的比较器,开发适度的并行性,恰当安排查找和排序过程的软硬功能分配,谋求速度与设备量的合理折衷。文中对相等、大于小于查找,最大值最小值查找,排序等典型操作,列举了相应的算法和实现考虑。

The method of multi-point parallel searching and sorting is based on seting a number of comparators, which could be selected in practical realization. The method properly compromises the cost and performance through rational distributing the functions of hardware and software on searching and sorting processing. In this paper, some algorithms and implementations are presented.