Parallel Sorting by Approximate Splitting for Multi-core Processors
Many pivot-based sorting methods benefit from balanced partition of data into smaller chunks with better parallelism and locality. However, it is difficult to partition data with the same high efficiency. This paper presents an improved partition method, Parallel Sorting by Approximate Splitting, which is based on an extend pivots selecting algorithm. Compared with other algorithm, such as PSRS, its splitter method is more flexibility and efficiency. Experiments which implemented by OpenMP in multi-cores environment and the theoretical analysis show the method is an efficiency algorithm with very good scalability.
Parallel sorting Multi Core OpenMP
Wu Wei Wu Pin Shang Weilie Fang Youtong
Department of Computer Science and Engineering Shanghai University Shanghai,China Department of Electronics Engineering Zhejiang University Hang Zhou,China
国际会议
黄山
英文
308-311
2010-05-28（万方平台首次上网日期，不代表论文的发表时间）