An efficient implementation of PSRS for multi-core systems

Multi-core sorting is one of the research focuses in the field of parallel algorithms. It is of great significance to improve multi-core systems' performance and promote its appliance. PSRS is a general multi-core sorting algorithm with the disadvantages of low portability and poor performance without the architecture characteristics. This paper presents an optimized method combined architecture features of multi-core systems with optimization techniques commonly used in sorting. It adopts the middle element by binary search, loser tree and CPU affinity setting to solve the problems of the fastest location in multi position binary search and the binding of multi-merge and process. Some experiment results show that the improved PSRS has good versatility with more than 2.69 speedup in three 4-core systems.