Melola Discovery

← Melola Discovery

Jurnal SINTA 2

IMPLEMENTATION OF SERIAL AND PARALLEL BUBBLE SORT ON FPGA

Jurnal Ilmu Komputer dan Informasi (JIKI) · Vol. 9 No. 2 (2016) · pp. 113–120

DOI
10.21609/jiki.v9i2.378
ISSN
2502-9274, 2088-7051
Published
2016-06-25
Publisher
Faculty of Computer Science - Universitas Indonesia
Language
eng

Abstract

Sorting is common process in computational world. Its utilization are on many fields from research to industry. There are many sorting algorithm in nowadays. One of the simplest yet powerful is bubble sort. In this study, bubble sort is implemented on FPGA. The implementation was taken on serial and parallel approach. Serial and parallel bubble sort then compared by means of its memory, execution time, and utility which comprises slices and LUTs. The experiments show that serial bubble sort required smaller memory as well as utility compared to parallel bubble sort. Meanwhile, parallel bubble sort performed faster than serial bubble sort

Keywords

Collaboration network of the authors

18 authors · 48 co-authorship links · 21 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • University of Indonesia
  • Utah State University
  • University of Edinburgh
  • Pelita Harapan University
  • KTH Royal Institute of Technology
  • Politeknik Negeri Malang
  • Diponegoro University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Machmud Roby AlhamidiUniversity of Indonesia3
Dwi PurnomoAffiliation unknown2
Muhammad Febrian RachmadiUniversity of Edinburgh2
Novian HabibieUniversity of Indonesia2
Benny HardjonoPelita Harapan University1
Grafika JatiUniversity of Indonesia1
Muhammad Iqbal TawakalKTH Royal Institute of Technology1
Adi WibowoDiponegoro University1
Arie Rachmad SyulistyoPoliteknik Negeri Malang1
Hanif Arief WisesaUniversity of Indonesia1
Satria Bagus WicaksonoAffiliation unknown1
Puteri Khatya FahiraUniversity of Indonesia1
Rafif Naufal RahmadikaAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://jiki.cs.ui.ac.id/index.php/jiki/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">IMPLEMENTATION OF SERIAL AND PARALLEL BUBBLE SORT ON FPGA</dc:title>
	<dc:creator>Purnomo, Dwi Marhaendro Jati</dc:creator>
	<dc:creator>Arinaldi, Ahmad</dc:creator>
	<dc:creator>Priyantini, Dwi Teguh</dc:creator>
	<dc:creator>Wibisono, Ari</dc:creator>
	<dc:creator>Febrian, Andreas</dc:creator>
	<dc:subject xml:lang="en-US">Sorting</dc:subject>
	<dc:subject xml:lang="en-US">bubble sort</dc:subject>
	<dc:subject xml:lang="en-US">serial bubble sort</dc:subject>
	<dc:subject xml:lang="en-US">parallel</dc:subject>
	<dc:subject xml:lang="en-US">comparison</dc:subject>
	<dc:subject xml:lang="en-US">memory</dc:subject>
	<dc:subject xml:lang="en-US">time</dc:subject>
	<dc:subject xml:lang="en-US">utility</dc:subject>
	<dc:description xml:lang="en-US">Sorting is common process in computational world. Its utilization are on many fields from research to industry. There are many sorting algorithm in nowadays. One of the simplest yet powerful is bubble sort. In this study, bubble sort is implemented on FPGA. The implementation was taken on serial and parallel approach. Serial and parallel bubble sort then compared by means of its memory, execution time, and utility which comprises slices and LUTs. The experiments show that serial bubble sort required smaller memory as well as utility compared to parallel bubble sort. Meanwhile, parallel bubble sort performed faster than serial bubble sort</dc:description>
	<dc:publisher xml:lang="en-US">Faculty of Computer Science  - Universitas Indonesia</dc:publisher>
	<dc:date>2016-06-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/378</dc:identifier>
	<dc:identifier>10.21609/jiki.v9i2.378</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Ilmu Komputer dan Informasi; Vol. 9 No. 2 (2016): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information); 113-120</dc:source>
	<dc:source>2502-9274</dc:source>
	<dc:source>2088-7051</dc:source>
	<dc:source>10.21609/jiki.v9i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/378/361</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Ilmu Komputer dan Informasi</dc:rights>
</oai_dc:dc>