An efficient implementation of PSRS for multi-core systems

Author

Songsong, He ; Naijie, Gu ; Yuping, Weng ; Lanfang, Ning

Author_Institution

Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China

fYear

2011

fDate

9-11 Sept. 2011

Firstpage

136

Lastpage

139

Abstract

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.

Keywords

multiprocessing systems; optimisation; parallel algorithms; sampling methods; sorting; tree searching; CPU affinity; PSRS implementation; loser tree; multicore sorting algorithm; multimerge process; multiposition binary search; optimization technique; parallel algorithm; Algorithm design and analysis; Arrays; Graphics processing unit; Hardware; Parallel algorithms; Sorting; CPU affinity; PSRS(parallel sorting by regular sampling); loop unrolling; loser tree; multi-binary search;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronics, Communications and Control (ICECC), 2011 International Conference on

Conference_Location

Ningbo

Print_ISBN

978-1-4577-0320-1

Type

conf

DOI

10.1109/ICECC.2011.6067636

Filename

6067636