This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computing Models for FPGA-Based Accelerators
November/December 2008 (vol. 10 no. 6)
pp. 35-45
Martin C. Herbordt, Boston University
Yongfeng Gu, MathWorks
Tom VanCourt, Altera Corp.
Josh Model, MIT's Lincoln Laboratory
Bharat Sukhwani, Boston University
Matt Chiu, Boston University
Field-programmable gate arrays are widely considered accelerators for compute-intensive applications. A critical phase of FPGA application development is finding and mapping to the appropriate computing model. These models differ from models generally used in programming. For example, whereas parallel computing models are often based on thread execution and interaction, FPGA computing can exploit more degrees of freedom than are available in software. This enables models with highly flexible fine-grained parallelism and associative operations such as broadcast and collective response. Several case studies demonstrate the effectiveness of using FPGA-based accelerators in molecular modeling.
Index Terms:
FPGAs, accelerators, computing models, molecular modeling
Citation:
Martin C. Herbordt, Yongfeng Gu, Tom VanCourt, Josh Model, Bharat Sukhwani, Matt Chiu, "Computing Models for FPGA-Based Accelerators," Computing in Science and Engineering, vol. 10, no. 6, pp. 35-45, Nov.-Dec. 2008, doi:10.1109/MCSE.2008.143
Usage of this product signifies your acceptance of the Terms of Use.