Implementation of Quicksort for Multi-Core Systems using OpenMP

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.이 논문은 지식경제부 출연금으로 ETRI와 시스템반도체산업진흥센터에서 수행한 ITSoC 핵심설계인력양성사업과 교육과학기술부의 재원으로 한국학술진흥재단에서 수행하는 BK21 프로젝트의 지원을 받아 수행된 연구입니다