IMPLEMENTATION OF SERIAL AND PARALLEL BUBBLE SORT ON FPGA
Keywords: Sorting, bubble sort, serial bubble sort, parallel, comparison, memory, time, utility
AbstractSorting 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
How to Cite
Purnomo, D. M. J., Arinaldi, A., Priyantini, D. T., Wibisono, A., & Febrian, A. (2016). IMPLEMENTATION OF SERIAL AND PARALLEL BUBBLE SORT ON FPGA. Jurnal Ilmu Komputer Dan Informasi, 9(2), 113-120. https://doi.org/10.21609/jiki.v9i2.378
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).