Performance of Parallel Computing in Bubble Sort Algorithm

Rihartanto Rihartanto, Arief Susanto, Ansar Rizal

Abstract


The performance of an algorithm can be improved by using a parallel computing programming approach. In this study, the performance of bubble sort algorithm on various computer specifications has been applied. Experimental results have shown that parallel computing programming can save significant time performance by 61%-65% compared to serial computing programming.

Keywords


Parallel Programming; Bubble Sort; OpenMP

Full Text:

PDF


DOI: http://doi.org/10.11591/ijeecs.v7.i3.pp861-866

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

The Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics