IMPLEMENTATION OF SERIAL AND PARALLEL BUBBLE SORT ON FPGA

  • Purnomo D
  • Arinaldi A
  • Priyantini D
  • et al.
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

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

Cite

CITATION STYLE

APA

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. https://doi.org/10.21609/jiki.v9i2.378

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free