International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 1 - Issue 19 |
Published: February 2010 |
Authors: Manwade K. B. |
![]() |
Manwade K. B. . Analysis of Parallel Merge Sort Algorithm. International Journal of Computer Applications. 1, 19 (February 2010), 66-69. DOI=10.5120/401-597
@article{ 10.5120/401-597, author = { Manwade K. B. }, title = { Analysis of Parallel Merge Sort Algorithm }, journal = { International Journal of Computer Applications }, year = { 2010 }, volume = { 1 }, number = { 19 }, pages = { 66-69 }, doi = { 10.5120/401-597 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2010 %A Manwade K. B. %T Analysis of Parallel Merge Sort Algorithm%T %J International Journal of Computer Applications %V 1 %N 19 %P 66-69 %R 10.5120/401-597 %I Foundation of Computer Science (FCS), NY, USA
The parallel computing on loosely coupled architecture has been evolved now days because of the availability of fast, inexpensive processors and advancements in communication technologies. The aim of this paper is to evaluate the performance of parallel merge sort algorithm on loosely coupled architecture and compare it with theoretical analysis [1].The parallel computational time complexity is O (p) [3] using p processes and one element in each process. It has been found that there is no major difference between theoretical performance analysis and the actual result.