The week's pick
Reseach Article
Analysis of Parallel Merge Sort Algorithm
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 1 - Number 19 |
| Year of Publication: 2010 |
| Authors: Manwade K. B. |
10.5120/401-597
|
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
Abstract
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.
References
- . K.B.Manwade, R.B.Patil; Parallel merge sort on loosely coupled architecture; National Conference, PSG Coimbator.
- .Ellis Horowitz, Sartaj Sahani, Sanguthevar Rajasekaran, “Computer Algorithms”, Galgotia publication.
- .Barry Wilkinson & Michael Charlotte, “Parallel programming techniques and applications using networked workstations and parallel computers”, Pearson publication.
- .http://penguin.ewu.edu/~trolfe/ParallelMerge/ParallelMerge.doc
- . Message Passing Interface Forum. MPI: A Message-Passing Interface Standard. Technical Report Version 1.0, University of Tennessee, Knoxville, Tennessee, June 1995.
- . The MPI Forum On-line, http://www.mpi-forum.org.
- .Ananath Grama, Anshul Gupta, “Parallel Computing”, Second edition, Addison-Wesley.
Index Terms
Keywords