![]() |
CiteULike | ![]() |
Group: Reconfigurable Computing | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Computing Models for FPGA-Based AcceleratorsComputing in Science & Engineering In Computing in Science & Engineering, Vol. 10, No. 6. (2008), pp. 35-45.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractField-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.
BibTeX record
RIS record