Efficient sorting algorithms for the cell broadband engine
Efficient sorting algorithms for the cell broadband engine
复制标题
DOI：
10.1109/iscc.2008.4625708
复制
发表时间：
2008-07
期刊：
影响因子：
--
通讯作者：
Dolly Sharma;V. Thapar;R. Ammar;S. Rajasekaran;Mohamed F. Ahmed
中科院分区：
文献类型：
--
作者：
Dolly Sharma;V. Thapar;R. Ammar;S. Rajasekaran;Mohamed F. Ahmed
排序问题已被广泛研究，文献中针对该问题提出了许多算法。关于并行排序的文献非常丰富。提出的许多算法虽然在理论上很重要，但由于其时间范围内的常数较大，在实践中可能无法令人满意地执行。本文提出的算法具有实用的潜力。我们提出了一些针对小区宽带引擎的新颖排序机制。我们尝试利用其架构的细节以获得最佳性能。作为比较分析的一部分，我们将这些算法与在 Itanium 2 处理器以及 Pentium 4 处理器上实现的类似算法并列。
The problem of sorting has been studied extensively and many algorithms have been suggested in the literature for the problem. Literature on parallel sorting is abundant. Many of the algorithms proposed, though being theoretically important, may not perform satisfactorily in practice owing to large constants in their time bounds. The algorithms presented in this paper have the potential of being practical. We suggest some novel sorting mechanisms specific to the cell broadband engine. We try to utilize the specifics of its architecture in order to get the optimum performance. As part of our comparative analysis we juxtapose these algorithms with similar ones implemented on Itanium 2 processor as well as the Pentium 4 processor.