Parallel Partition Revisited

WEA'08: Proceedings of the 7th international conference on Experimental algorithms(2008)

引用 5|浏览29
暂无评分
摘要
In this paper we consider parallel algorithms to partition an array with respect to a pivot. We focus on implementations for current widely available multi-core architectures. After reviewing existing algorithms, we propose a modification to obtain the minimal number of comparisons. We have implemented these algorithms and drawn an experimental comparison.
更多
查看译文
关键词
Parallel Time, Tree Data Structure, Parallel Phase, Left Block, Splitting Position
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要