CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Analysis of Parallel Merge Sort Algorithm

by Manwade K. B.
journal cover thumbnail

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

@article{ 10.5120/401-597,
author = { Manwade K. B. },
title = { Analysis of Parallel Merge Sort Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 19 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 66-69 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number19/401-597/ },
doi = { 10.5120/401-597 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:46:57.465404+05:30
%A Manwade K. B.
%T Analysis of Parallel Merge Sort Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 19
%P 66-69
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
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
  1. . K.B.Manwade, R.B.Patil; Parallel merge sort on loosely coupled architecture; National Conference, PSG Coimbator.
  2. .Ellis Horowitz, Sartaj Sahani, Sanguthevar Rajasekaran, “Computer Algorithms”, Galgotia publication.
  3. .Barry Wilkinson & Michael Charlotte, “Parallel programming techniques and applications using networked workstations and parallel computers”, Pearson publication.
  4. .http://penguin.ewu.edu/~trolfe/ParallelMerge/ParallelMerge.doc
  5. . Message Passing Interface Forum. MPI: A Message-Passing Interface Standard. Technical Report Version 1.0, University of Tennessee, Knoxville, Tennessee, June 1995.
  6. . The MPI Forum On-line, http://www.mpi-forum.org.
  7. .Ananath Grama, Anshul Gupta, “Parallel Computing”, Second edition, Addison-Wesley.
Index Terms

Computer Science
Information Sciences

Keywords

Parallel computing Parallel Algorithms Message Passing Interface Merge sort Complexity

Powered by PhDFocusTM