Comparative study of parallel implementation for searching algorithms with openMP

Renea Chowdhury Shormee, Ravie Chandren Muniyandi, D. I.P. Nandi

Research output: Contribution to journalArticle

Abstract

Investigating the multi-core architecture is an essential issue to get superior in parallel reenactments. However, the simulation highlights must fit on parallel programming model to build the execution. The main goal of this research is to choose and evaluate parallelism using OpenMP over sequential program. For this purpose, there is a portrayal of two searching algorithms. The calculation is to discover the next edge of Prim's algorithm and single source shortest way of Dijkstra's algorithm. These two algorithm actualized in sequential formulation. Parallel searching algorithms are then implemented in view of multicore processor. The speed-up ratio and efficiency of parallel searching algorithms are tested and investigated in SGEMM GPU Kernel performance dataset with 241600 records and 18 attributes. Results show the dataset with different data sizes achieved super linear speed-up ratio and efficiency on OpenMP by running on 4 cores processor and reduction of the running time over sequential program. More importantly, the new implementation drastically decreases the time of execution for thread 8 for Prims algorithm from 5.16ms to 1.48 ms for Dijkstra algorithm. Parallel calculation is impressively powerful for huge graph size. General outcome shows that multi-threaded parallelism is exceptionally successful to accomplish better performance for dataset based on searching algorithms by separating the primary dataset into sub-datasets to increase diversity on arrangement investigation.

Original languageEnglish
Pages (from-to)6329-6338
Number of pages10
JournalJournal of Theoretical and Applied Information Technology
Volume96
Issue number19
Publication statusPublished - 15 Oct 2018

Fingerprint

OpenMP
Parallel Implementation
Comparative Study
Dijkstra Algorithm
Parallelism
Speedup
Multi-core Processor
Parallel Programming
Thread
Parallel programming
Programming Model
Arrangement
Choose
Attribute
kernel
Decrease
Formulation
Evaluate
Graph in graph theory
Simulation

Keywords

  • Dijkstra’s
  • OpenMP
  • Parallel programming
  • Prim’s
  • Sequential programming

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Comparative study of parallel implementation for searching algorithms with openMP. / Shormee, Renea Chowdhury; Muniyandi, Ravie Chandren; Nandi, D. I.P.

In: Journal of Theoretical and Applied Information Technology, Vol. 96, No. 19, 15.10.2018, p. 6329-6338.

Research output: Contribution to journalArticle

@article{79a2ce4b5b9e405a90f2e8b45c1308c4,
title = "Comparative study of parallel implementation for searching algorithms with openMP",
abstract = "Investigating the multi-core architecture is an essential issue to get superior in parallel reenactments. However, the simulation highlights must fit on parallel programming model to build the execution. The main goal of this research is to choose and evaluate parallelism using OpenMP over sequential program. For this purpose, there is a portrayal of two searching algorithms. The calculation is to discover the next edge of Prim's algorithm and single source shortest way of Dijkstra's algorithm. These two algorithm actualized in sequential formulation. Parallel searching algorithms are then implemented in view of multicore processor. The speed-up ratio and efficiency of parallel searching algorithms are tested and investigated in SGEMM GPU Kernel performance dataset with 241600 records and 18 attributes. Results show the dataset with different data sizes achieved super linear speed-up ratio and efficiency on OpenMP by running on 4 cores processor and reduction of the running time over sequential program. More importantly, the new implementation drastically decreases the time of execution for thread 8 for Prims algorithm from 5.16ms to 1.48 ms for Dijkstra algorithm. Parallel calculation is impressively powerful for huge graph size. General outcome shows that multi-threaded parallelism is exceptionally successful to accomplish better performance for dataset based on searching algorithms by separating the primary dataset into sub-datasets to increase diversity on arrangement investigation.",
keywords = "Dijkstra’s, OpenMP, Parallel programming, Prim’s, Sequential programming",
author = "Shormee, {Renea Chowdhury} and Muniyandi, {Ravie Chandren} and Nandi, {D. I.P.}",
year = "2018",
month = "10",
day = "15",
language = "English",
volume = "96",
pages = "6329--6338",
journal = "Journal of Theoretical and Applied Information Technology",
issn = "1992-8645",
publisher = "Asian Research Publishing Network (ARPN)",
number = "19",

}

TY - JOUR

T1 - Comparative study of parallel implementation for searching algorithms with openMP

AU - Shormee, Renea Chowdhury

AU - Muniyandi, Ravie Chandren

AU - Nandi, D. I.P.

PY - 2018/10/15

Y1 - 2018/10/15

N2 - Investigating the multi-core architecture is an essential issue to get superior in parallel reenactments. However, the simulation highlights must fit on parallel programming model to build the execution. The main goal of this research is to choose and evaluate parallelism using OpenMP over sequential program. For this purpose, there is a portrayal of two searching algorithms. The calculation is to discover the next edge of Prim's algorithm and single source shortest way of Dijkstra's algorithm. These two algorithm actualized in sequential formulation. Parallel searching algorithms are then implemented in view of multicore processor. The speed-up ratio and efficiency of parallel searching algorithms are tested and investigated in SGEMM GPU Kernel performance dataset with 241600 records and 18 attributes. Results show the dataset with different data sizes achieved super linear speed-up ratio and efficiency on OpenMP by running on 4 cores processor and reduction of the running time over sequential program. More importantly, the new implementation drastically decreases the time of execution for thread 8 for Prims algorithm from 5.16ms to 1.48 ms for Dijkstra algorithm. Parallel calculation is impressively powerful for huge graph size. General outcome shows that multi-threaded parallelism is exceptionally successful to accomplish better performance for dataset based on searching algorithms by separating the primary dataset into sub-datasets to increase diversity on arrangement investigation.

AB - Investigating the multi-core architecture is an essential issue to get superior in parallel reenactments. However, the simulation highlights must fit on parallel programming model to build the execution. The main goal of this research is to choose and evaluate parallelism using OpenMP over sequential program. For this purpose, there is a portrayal of two searching algorithms. The calculation is to discover the next edge of Prim's algorithm and single source shortest way of Dijkstra's algorithm. These two algorithm actualized in sequential formulation. Parallel searching algorithms are then implemented in view of multicore processor. The speed-up ratio and efficiency of parallel searching algorithms are tested and investigated in SGEMM GPU Kernel performance dataset with 241600 records and 18 attributes. Results show the dataset with different data sizes achieved super linear speed-up ratio and efficiency on OpenMP by running on 4 cores processor and reduction of the running time over sequential program. More importantly, the new implementation drastically decreases the time of execution for thread 8 for Prims algorithm from 5.16ms to 1.48 ms for Dijkstra algorithm. Parallel calculation is impressively powerful for huge graph size. General outcome shows that multi-threaded parallelism is exceptionally successful to accomplish better performance for dataset based on searching algorithms by separating the primary dataset into sub-datasets to increase diversity on arrangement investigation.

KW - Dijkstra’s

KW - OpenMP

KW - Parallel programming

KW - Prim’s

KW - Sequential programming

UR - http://www.scopus.com/inward/record.url?scp=85055747545&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85055747545&partnerID=8YFLogxK

M3 - Article

VL - 96

SP - 6329

EP - 6338

JO - Journal of Theoretical and Applied Information Technology

JF - Journal of Theoretical and Applied Information Technology

SN - 1992-8645

IS - 19

ER -