By Topic

An efficient implementation of PSRS for multi-core systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
He Songsong ; Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China ; Gu Naijie ; Weng Yuping ; Ning Lanfang

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.

Published in:

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

Date of Conference:

9-11 Sept. 2011