Optimal Parallel Algorithm of Merge Sort Based on OpenMP

Hai Long Shen

doi:10.4028/www.scientific.net/AMM.556-562.3400

Paper Titles

Research on Combination Optimization of Parameters and Character Choice for SVM Based on Simulated Annealing and Improved QPSO
p.3384

Meteorological Data Mining Based on Rough Set Attributes Reduction and Decision Tree
p.3388

Application of Linear Algebra in Real Life
p.3392

Application of Matrix in Computer Science and Technology
p.3396

Optimal Parallel Algorithm of Merge Sort Based on OpenMP
p.3400

The Study of Traffic Queuing Based on Computer Simulations and Queuing Theory
p.3404

Application of the Speech Enhancement Technology in Flight Simulation System
p.3408

Iris Feature Extraction Based on the Fuzzy Clustering Evaluation Algorithm
p.3412

Self-Adapted Layer Contrast Enhancement Algorithm Based on Medical Image
p.3416

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 556-562Optimal Parallel Algorithm of Merge Sort Based on...

Optimal Parallel Algorithm of Merge Sort Based on OpenMP

Abstract:

The parallel algorithm of merge sort is proposed. The improvements of merge sort are analyzed in this paper. OpenMP is applied in the proposed algorithm for implementation. The results of complexity and execution time of the proposed algorithm indicate that the parallel algorithm approach the optimal case.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 556-562)

Pages:

3400-3403

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.556-562.3400

Citation:

Cite this paper

Online since:

May 2014

Authors:

Hai Long Shen*

Keywords:

Multi-Core, Multi-Thread, Parallel, Sort

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Knuth Donald. The Art of Computer Programming 3, Addison-Wesley Educational Publishers, (2005).

Google Scholar

[2] C. Amza, A. L. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, and W. Zwaenepoel. TreadMarks: Shared memory computing on networks of workstations. IEEE Computer, 29(2), (1996).

DOI: 10.1109/2.485843

Google Scholar

[3] B. N. Bershad, T. E. Anderson, E. D. Lazowska, and H. M. Levy. Lightweight remote procedure call. ACM Transactions on Computer Systems, 8(1): 37–55, (1990).

DOI: 10.1145/77648.77650

Google Scholar

[4] P. Charles, C. Grotho, V. Saraswat, C. Donawa, A. Kielstra, K. Ebcioglu, C. von Praun, and V. Sarkar. X10: an object-oriented approach to non-uniform cluster computing. In Proceedings of the ACM Symposium on Object-Oriented Programming Systems, Languages, and Applications, pages 519–538, (2005).

DOI: 10.1145/1094811.1094852

Google Scholar

[5] Zhang Yingqian, Sun bin, Liu Jia. A Markup Language for Parallel Programming Model on Multi-Core System. Published in proceedings of Scalable Computing and Communications (ScalCom) , China. IEEE Computer Society, 2009, 641-643.

DOI: 10.1109/embeddedcom-scalcom.2009.122

Google Scholar