DocumentCode :
2906631
Title :
Performance of sorting algorithms on the SRC 6 reconfigurable computer
Author :
Harkins, John ; El-Ghazawi, Tarek ; El-Araby, Esam ; Huang, Miaoqing
Author_Institution :
George Washington Univ., Washington, DC, USA
fYear :
2005
fDate :
11-14 Dec. 2005
Firstpage :
295
Lastpage :
296
Abstract :
The execution speed of the FPGA processing elements are compared to the microprocessor processing elements in the SRC 6 reconfigurable computer using the following algorithms for sorting: quick sort, heap sort, radix sort, bitonic sort, and odd/even merge. The results show that, for sorting, FPGA technology may not be the best processor choice and that factors such as memory bandwidth, clock speed, algorithm computational density and an algorithm´s ability to be pipelined all have an impact on FPGA performance.
Keywords :
field programmable gate arrays; microprocessor chips; reconfigurable architectures; sorting; SRC 6 reconfigurable computer; bitonic sort; clock speed; even merge; field programmable gate array; hardware compiler; heap sort; memory bandwidth; microprocessor processing elements; odd merge; quick sort; radix sort; sorting algorithms; Bandwidth; Clocks; Field programmable gate arrays; Hardware; High performance computing; Microprocessors; Pipeline processing; Sorting; System performance; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Field-Programmable Technology, 2005. Proceedings. 2005 IEEE International Conference on
Print_ISBN :
0-7803-9407-0
Type :
conf
DOI :
10.1109/FPT.2005.1568568
Filename :
1568568
Link To Document :
بازگشت