Many sorting algorithms have been proposed and implemented in previous years. These algorithms are usually judged by their performance in term of algorithm growth rate according to the input size. Efficient sorting algorithm implementation is important for optimizing the use of other algorithms such as searching algorithms, load balancing algorithms, etc. In this paper, parallel Quicksort, parallel Merge sort, and parallel Merge-Quicksort algorithms are evaluated and compared in terms of the running time, speedup, and parallel efficiency. These sorting algorithms are implemented using Message Passing Interface (MPI) library, and results have been conducted using IMAN1 supercomputer. Results show that the run time of parallel Quicksort algorithm outperforms both Merge sort and Merge-Quicksort algorithms. Moreover, on large number of processors, parallel Quicksort achieves the best parallel efficiency of up to 88%, while Merge sort and Merge-Quicksort algorithms achieve up to 49% and 52% parallel efficiency, respectively.
목차
Abstract 1. Introduction 2. Related Works 3. An Overview of Sequential and Parallel Quicksort 3.1. Sequential Quicksort 3.2. Parallel Quicksort 4. An Overview of Sequential and Parallel Merge Sort 4.1. Sequential Merge Sort 4.2. Parallel Merge Sort 5. An Overview of Parallel Merge-Quicksort 6. Performance Evaluation and Results 6.1. Run Time Evaluation 6.2. Speedup Evaluation 6.3. Parallel Efficiency Evaluation 7. Conclusion References
Maha Saadeh [ Department of Computer Science, King Abdullah II School for Information Technology, University of Jordan, Amman, Jordan ]
Corresponding author
Huda Saadeh [ Department of Computer Science, King Abdullah II School for Information Technology, University of Jordan, Amman, Jordan ]
Mohammad Qatawneh [ Department of Computer Science, King Abdullah II School for Information Technology, University of Jordan, Amman, Jordan ]
보안공학연구지원센터(IJAST) [Science & Engineering Research Support Center, Republic of Korea(IJAST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Advanced Science and Technology
간기
월간
pISSN
2005-4238
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Advanced Science and Technology Vol.95