DocumentCode :
3643166
Title :
Accelerating Large-Scale HPC Applications Using FPGAs
Author :
Rob Dimond;Sebastien Racanière;Oliver Pell
fYear :
2011
fDate :
7/1/2011 12:00:00 AM
Firstpage :
191
Lastpage :
192
Abstract :
Field Programmable Gate Arrays (FPGAs) are conventionally considered as ´glue-logic´. However, modern FPGAs are extremely competitive compared to state-of-the-art CPUs for commercial HPC workloads, such as those found in Oil and Gas and Finance. For example, an FPGA accelerated system can be 31-37 times faster than an equivalently sized conventional machine, and consume 1/39 of the power. The key to achieving the best performance in FPGA accelerators, while maintaining correctness, is optimization of arithmetic units and data types to suit the range/precision at each point in the computation. The flexibility of the FPGA to implement non-standard arithmetic, combined with a data-flow programming model that instantiates a separate unit for each arithmetic operator in the code provides a wide design space. As such, FPGA computing offers significant opportunity for arithmetic research into ´large scale´ HPC applications, where there is an opportunity to move away from standard IEEE formats, either to improve precision compared to the CPU version or to increase speed.
Keywords :
"Field programmable gate arrays","Convolution","Stacking","Optimization","Acceleration","Bandwidth","Kernel"
Publisher :
ieee
Conference_Titel :
Computer Arithmetic (ARITH), 2011 20th IEEE Symposium on
ISSN :
1063-6889
Print_ISBN :
978-1-4244-9457-6
Type :
conf
DOI :
10.1109/ARITH.2011.34
Filename :
5992126
Link To Document :
بازگشت