DocumentCode
3533745
Title
An accelerator for K-TH nearest neighbor thinning based on the IMORC infrastructure
Author
Schumacher, Tobias ; Plessl, Christian ; Platzner, Marco
Author_Institution
Paderborn Center for Parallel Comput., Univ. of Paderborn, Paderborn, Germany
fYear
2009
fDate
Aug. 31 2009-Sept. 2 2009
Firstpage
338
Lastpage
344
Abstract
The creation and optimization of FPGA accelerators comprising several compute cores and memories are challenging tasks in high performance reconfigurable computing. In this paper, we present the design of such an accelerator for the kth nearest neighbor thinning problem on an XD1000 reconfigurable computing system. The design leverages IMORC, an architectural template and highly versatile on-chip interconnect, to achieve speedups of 74 times over a 2.2 GHz Opteron. Using IMORC with its asynchronous FIFOs and bitwidth conversion in the links between the cores, we are able to quickly create acclerator versions with varying degrees of core-level parallelism and memory mappings. Through the performance monitoring infrastructure of IMORC we gain insight into the data-dependent behavior of the accelerator which facilitates further performance optimizations.
Keywords
field programmable gate arrays; integrated circuit interconnections; logic design; pattern recognition; FPGA accelerator design; IMORC infrastructure; Opteron; XD1000 reconfigurable computing system; architectural template; asynchronous FIFO; bitwidth conversion; core-level parallelism; data-dependent behavior; k-th nearest neighbor thinning; memory mappings; performance optimizations; versatile on-chip interconnect; Computerized monitoring; Concurrent computing; Field programmable gate arrays; Frequency estimation; High performance computing; Master-slave; Nearest neighbor searches; Optimization; Parallel processing; Predictive models;
fLanguage
English
Publisher
ieee
Conference_Titel
Field Programmable Logic and Applications, 2009. FPL 2009. International Conference on
Conference_Location
Prague
ISSN
1946-1488
Print_ISBN
978-1-4244-3892-1
Electronic_ISBN
1946-1488
Type
conf
DOI
10.1109/FPL.2009.5272270
Filename
5272270
Link To Document