A NEW EFFICIENT ALGORITHM BASED ON ODD-EVEN TRANSPOSITION SORT ALGORITHM FOR MERGESORT ON GRID COMPUTER

Zaidatul Aqmar binti Zakaria #1, Mohamed Faidz Mohamed Said #2

# Universiti Teknologi MARA
70300 Seremban Negeri Sembilan, MALAYSIA

1 zaiaqmar74@gmail.com
2 faidzms@ieee.org


Abstract –This paper discussed about a new parallel sorting algorithm, which is imitative from the odd-even Merge Sort algorithm, titled “partition and concurrent merging” (PCM). To categorize all the components, the comparisons of individual elements must be generated professionally. A divide and conquer strategy Merge Sort are used to sort an array proficiently while making a smallest number of contrasts between the array components. Merge sort is known as one of the most effective ways to figure out the sorting problem. The research recommends that it is approachable to knowing optimizations. A fast variation of Merge sort also has been proposed significantly in this paper. So, it is quite efficient for using the Odd-Even Transposition sort algorithm by Merge Sort.

Keywords: odd-even transposition sort algorithm, mergesort, grid computer



REFERENCES

[1]	M. T. V. S. V. Mr.Bobba Veera Mallu, Mr.K.Srinivasulu Achari, "Novelty Approach of “Odd-Even Transposition Technique”," vol. 3, 2013.

[2]	D. Abhyankar, "A Fast Merge Sort," International Journal of engineering Research and Applications, vol. 1, pp. 131-134.

[3]	V. Pravalika, L. K. R. Babu, R. DileepKumar, and M. T. Reddy, "Odd Even Merge Sort based on INDEX."

[4]	R. Hibbler, "Merge Sort," ed: Dept. of Computer Science. Florida Institute of Technology. Florida, USA, 2008.

[5]	P. Sareen, "Comparison of sorting algorithms (on the basis of average case)," International Journal of Advanced Research in Computer Science and Software Engineering, vol. 3, pp. 522-532, 2013.

[6]	K. Manwade, "Analysis of Parallel Merge Sort Algorithm," Analysis, vol. 1, 2010.

[7]	H. Rashid and K. Qureshi, "A practical performance comparison of parallel sorting algorithms on homogeneous network of workstations," WSEAS Transactions on Computers, vol. 5, pp. 1606-1610, 2006.

[8]	D. Prasad, M. Y. M. Yusof, S. S. Palai, and A. H. Nawi, "Sorting networks on FPGA," in Proceedings of the 10th WSEAS international conference on Telecommunications and informatics and microelectronics, nanoelectronics, optoelectronics, and WSEAS international conference on Signal processing, 2011, pp. 29-31.

[9]	D. Aremu, O. Adesina, O. Makinde, O. Ajibola, and O. Agbo-Ajala, "A Comparative Study of Sorting Algorithms," African Journal of Computing & ICT, vol. 6, 2013.

[10]	G. Kocher and N. Agrawal, "Analysis and Review of Sorting Algorithms," Analysis, vol. 2, 2014.

[11]	M. J. S. S. Miss. Pooja K. Chhatwani, "Comparative Analysis & Performance of Different Sorting Algorithm in Data Structure," vol. Volume 3, p. 8, November 2013.

[12]	O. S. Ivan Tsmots, Volodymyr Antoniv, "Parellel Algorithm and Structure for Implementation of Merge Sort.pdf," vol. 5, p. 10, March 2016.

[13]	K. S. Al-Kharabsheh, I. M. AlTurani, A. M. I. AlTurani, and N. I. Zanoon, "Review on Sorting Algorithms A Comparative Study," International Journal of Computer Science and Security (IJCSS), vol. 7, pp. 120-126, 2013.

[14]	E. Herruzo, G. Ruiz, J. I. Benavides, and O. Plata, "A New Parallel Sorting Algorithm based on Odd-Even Mergesort," pp. 18-22, 2007.