Comparative Study of Parallel Odd Even Transposition and Rank Sort Algorithm
Manpreet Kaur
Ms. Manpreet Kaur, Asst. Prof., in PG Department of Computer Applications, Khalsa College for Women, Amritsar, India.
Manuscript received on November 02, 2014. | Revised Manuscript received on November 04, 2014. | Manuscript published on November 05, 2014. | PP: 70-72 | Volume-4 Issue-5, November 2014. | Retrieval Number: E2423114514/2014©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this paper, the execution behaviours of different parallel sorting algorithms like odd-even transposition sort and parallel rank sort have been invested with multithreading. Multithreading in JAVA programming language provides a mechanism where parallel algorithms are implemented by far. The performance of implemented algorithms is evaluated on the basis of execution time. It has been found that parallel odd even Transposition algorithm is giving better performance as compared with rank sort algorithm
Keywords: Parallel sorting algorithms, performance analysis, Multithreading.