Analysis of Parallel Merge Sort Algorithm

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 .The parallel computational time complexity is O (p) 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.

Provided by: International Journal of Computer Applications Topic: Data Centers Date Added: Aug 2010 Format: PDF

Download Now

Find By Topic