Abstract | ||
---|---|---|
We propose a new approach, based on a set of convex models, to accelerate an application using a computing cluster which contains field-programmable gate arrays (FPGAs). The computationally-intensive tasks of the application are mapped onto multiple acceleration nodes, and the datapaths on the nodes are customized around the tasks during compilation. We propose models for computation and communication on the FPGA-based cluster, and formulate the design problem as a convex non-linear optimization problem allowing design exploration. We evaluate our approach on a cluster with 16 nodes for Monte Carlo simulation, resulting in a design 690 times faster than a software implementation. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1109/FPT.2010.5681466 | FPT |
Keywords | Field | DocType |
datapaths,field-programmable gate arrays,convex models,monte carlo simulation,convex nonlinear optimization problem,convex programming,computing cluster,logic design,monte carlo methods,multiple acceleration nodes,field programmable gate arrays,fpga-based clusters,computational modeling,acceleration,trajectory,optimization,mathematical model,field programmable gate array | Logic synthesis,Cluster (physics),Monte Carlo method,Computer science,Parallel computing,Field-programmable gate array,Convex optimization,Optimization problem,Computer cluster,Computation | Conference |
ISBN | Citations | PageRank |
978-1-4244-8980-0 | 2 | 0.45 |
References | Authors | |
3 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Qiang Liu | 1 | 160 | 16.34 |
Tim Todman | 2 | 65 | 12.10 |
K. H. Tsoi | 3 | 399 | 38.79 |
Wayne Luk | 4 | 3752 | 438.09 |