Browse

OpenMP를 이용한 빠른 정렬의 멀티 코어 구현
Implementation of Quicksort for Multi-Core Systems using OpenMP

Cited 0 time in Web of Science Cited 0 time in Scopus
Authors
성백상; 성운용
Issue Date
2009-07
Publisher
대한전자공학회 = The Institute of Electronics Engineers of Korea
Citation
대한전자공학회 2009년 하계종합학술대회 2009. 7
Abstract
Quicksort is the fastest among sorting algorithms which use comparison of keys, and it can be parallelized easily due to its algorithmic characteristics. In this paper, we implemented the parallelized quicksort which utilizes shared memory programming, OpenMP. We improved the algorithm of hyperquicksort and obtained the speed-up of mean 250% with a quad-core based system.
Language
Korean
URI
http://www.ieek.or.kr

http://hdl.handle.net/10371/6173
Files in This Item:
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Electrical and Computer Engineering (전기·정보공학부)Others_전기·정보공학부
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse