Performance of Parallel Computing in Bubble Sort Algorithm

Rihartanto, Rihartanto and Susanto, Ariefpjl and Rizal, Ansar Performance of Parallel Computing in Bubble Sort Algorithm. Indonesian Journal of Electrical Engineering and Computer Science, 7 (3). pp. 861-866. ISSN DOI: 10.11591/ijeecs.v7.i3.pp861-866

[thumbnail of Cover]
Preview
Image (Cover)
Cov Performance.png - Published Version

Download (75kB) | Preview
[thumbnail of Artikel Jurnal]
Preview
Text (Artikel Jurnal)
2017 IJEECS Performance of Parallel Computing in Bubble Sort.pdf - Published Version

Download (563kB) | Preview
[thumbnail of Hasil Cek Plagiasi]
Preview
Text (Hasil Cek Plagiasi)
04_12%_IJEECS Performance of Parallel Computing in Bubble Sort.pdf - Published Version

Download (974kB) | Preview

Abstrak

The performance of an algorithm can be improved 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

Item Type: Article
Kata Kunci: Parallel Programming; Bubble Sort; OpenMP
Subjects: Teknologi > Teknologi (umum)
Program Studi: Fakultas Teknik > S1 Teknik Informatika
Depositing User: Mr Arief Susanto
Date Deposited: 04 Jul 2023 20:04
Last Modified: 04 Jul 2023 20:04
URI: http://eprints.umk.ac.id/id/eprint/18577

Actions (login required)

View Item View Item