Please use this identifier to cite or link to this item:
|Title:||Co-synthesis of FPGA-based application-specific floating point SIMD accelerators|
|Source:||Hagiescu, A.,Wong, W.-F. (2011). Co-synthesis of FPGA-based application-specific floating point SIMD accelerators. ACM/SIGDA International Symposium on Field Programmable Gate Arrays - FPGA : 247-256. ScholarBank@NUS Repository. https://doi.org/10.1145/1950413.1950459|
|Abstract:||The constant push for feature richness in mobile and embedded devices has significantly increased computational demand. However, stringent energy constraints typically remain in place. Embedding processor cores in FPGAs offers a path to having customized instruction processors that can meet the performance and energy demands. Ideally, the customization process should be automated to reduce the design effort, and indirectly the time to market. However, the automatic generation of custom extensions for floating point computation remains a challenge in FPGA co-design. We propose an approach for accelerating such computation via application-specific SIMD extensions. We describe an automated co-design toolchain that generates code and application-specific platform extensions that implement SIMD instructions with a parameterizable number of vector elements. The parallelism exposed by encapsulating computation in vector instructions is matched to an adjustable pool of execution units. Experiments on actual hardware show significant performance improvements. Our framework provides an important extension to the capabilities of embedded processor FPGAs which traditionally dealt with bit, integer, and low intensity floating point code, to now being able to handle vectorizable floating point computation. Copyright 2011 ACM.|
|Source Title:||ACM/SIGDA International Symposium on Field Programmable Gate Arrays - FPGA|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.