Software

Performance Analysis of Odd-Even Merge Sort by Using Openmp, MPI and Concurrent Java

Download Now Free registration required

Executive Summary

In recent years with the advent of programming techniques, parallel programming consumes less execution time as compared to sequential. The odd-even merge sort algorithm was developed by K.E. Batcher. It takes two sorted array and merge them into a single sorted array. In this paper, the authors have implemented this algorithm in three different modules and compared the performance of sequential with parallel. Parallelism is achieved by using #pragma parallel in openmp, using message passing in MPI and by using threads in concurrent java.

  • Format: PDF
  • Size: 102.2 KB