IMPLEMENTATION OF SERIAL AND PARALLEL BUBBLE SORT ON FPGA

Dwi Marhaendro Jati Purnomo (Faculty of Computer Science, Universitas Indonesia, Kampus Baru UI, Depok, 16424, Indonesia)
Ahmad Arinaldi (Faculty of Computer Science, Universitas Indonesia, Kampus Baru UI, Depok, 16424, Indonesia)
Dwi Teguh Priyantini (Faculty of Computer Science, Universitas Indonesia, Kampus Baru UI, Depok, 16424, Indonesia)
Ari Wibisono (Faculty of Computer Science, Universitas Indonesia, Kampus Baru UI, Depok, 16424, Indonesia)
Andreas Febrian (Department of Engineering Education, Utah State University, United States of America)

Jurnal Ilmu Komputer dan Informasi
Vol 9, No 2 (2016): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)

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