Algorithm Improvement of Two-Way Merge Sort Based on OpenMP

Jun Zhang; Yong Ping Gao; Yue Shun He; Xue Yuan Wang

doi:10.4028/www.scientific.net/AMM.701-702.24

Paper Titles

Research of the Method for Traffic Generating Based on Genetic Algorithm
p.3

A Novel Weighted Distance KNN Algorithm Based on Instances Condensing
p.8

A Quick Reduction Algorithm Based on Important Index
p.13

A Special Multiobjective Evolutionary Algorithm for Solving Complicated Nonlinear Equations Systems
p.18

Algorithm Improvement of Two-Way Merge Sort Based on OpenMP
p.24

Driver Fatigue Detection Algorithm Research Based on the Characteristics of Eyes
p.30

Explore Traditional Chinese Medicine Prescription Compatibility Based on Local Partial Least Squares
p.36

Fuzzy Analytic Hierarchy Process Method for Civil Aviation Airport Security Information Management
p.40

Genetic Algorithm for the Capacitated Chinese Postman Problem on Mixed Networks
p.44

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 701-702Algorithm Improvement of Two-Way Merge Sort Based...

Algorithm Improvement of Two-Way Merge Sort Based on OpenMP

Abstract:

Two-way merge sort algorithm has a good time efficiency which has been used widely. The sort algorithm can be improved on speed and efficient based on its own potential parallelism via the parallel processing capacity of multi-core processor and the convenient programming interface of OpenMP. The time complexity is improved to O(nlog₂n/TNUM) and inversely proportional to the number of parallel threads. The experiment results show that the improved two-way merge sort algorithm become much more efficient compared to the traditional one.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 701-702)

Pages:

24-29

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.701-702.24

Citation:

Cite this paper

Online since:

December 2014

Authors:

Jun Zhang*, Yong Ping Gao, Yue Shun He, Xue Yuan Wang

Keywords:

Multicore, OpenMP, Parallel Execution, Two-Way Merge Sort

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Weimin Yan. Data Structure(C language)[M]. (Tsinghua University Press China 2010).

Google Scholar

[2] Qing Tuo, Guicheng Xiang, Yaohu Song: Journal of Computer Applications, vol. 31(2011), p.55. (In Chinese).

Google Scholar

[3] Yaling Tang, Feng Qin: Computer Engineering, vol. 37(2011), p.173. (In Chinese).

Google Scholar

[4] Shankun Wang， Zhenrong Tao: Application Research of Computers, vol. 29(2012), p.2513. (In Chinese).

Google Scholar

[5] Ligang Liang, Chao Yi, Xiucheng Yang, et al: Computer Applications and Software, vol. 29 (2012), p.283. (In Chinese).

Google Scholar

[6] Xiaojie Qian, Xiufang Li: Micro Electronics & Computer, vol. 28(2011), p.116. (In Chinese).

Google Scholar

[7] Satish N, Harris M, Garland M. Designing efficient sorting algorithms for manycore GPUs[C]. Parallel & Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium on. IEEE, 2009: 1-10.

DOI: 10.1109/ipdps.2009.5161005

Google Scholar

[8] Gedik B, Bordawekar R R, Yu P S. CellSort: high performance sorting on the cell processor[C]. Proceedings of the 33rd international conference on Very large data bases. VLDB Endowment, 2007: 1286-1297.

Google Scholar

[9] Wenyi Wang , Yong Qiu: Computer Engineering and Applications, vol. 5(2005), p.71. (In Chinese).

Google Scholar