Downloads: 134 | Views: 309

Research Paper | Computer Science & Engineering | India | Volume 1 Issue 2, November 2012 | Popularity: 6.1 / 10

Rate This Article!      

An Adaptive Framework towards Analyzing the Parallel Merge Sort

Husain Ullah Khan, Rajesh Tiwari

Abstract: The parallel computing on loosely coupled architecture has been evolved now a day because of the availability of fast and, inexpensive processors and advancements in communication technologies. The aim of this paper is to evaluate the performance of parallel merge sort algorithm on parallel programming environments such as MPI. The MPI libraries has been used to established the communication and synchronization between the processes Merge sort is analyze in this paper because it is an efficient divide-and-conquer sorting algorithm. it is easier to understand than other useful divide-and-conquer strategies Due to the importance of distributed computing power of workstations or PCs connected in a local area network. Our aim is to study the performance evaluation of parallel merge sort.

Keywords: parallel computing, parallel Algorithms, Message Passing Interface, Merge sort, performance analysis

Edition: Volume 1 Issue 2, November 2012

Pages: 31 - 34

DOI: https://www.doi.org/10.21275/IJSR11120222

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article