Name
Abstract | ||
|---|---|---|
This article describes a class of reconfigurable computing system called online architectures. These architectures use an online algorithm to make run-time reconfiguration decisions that continually adapt the underlying architecture to match the application’s current computational demand. Online architectures have several potential advantages, including better resource utilization (reduced cost), faster execution, and reduced (static) power consumption. However, to realize these benefits, online architectures must balance the overhead (reconfiguration, profiling, and decision costs) against expected gains of reconfiguration. In this article, the basic foundation of online architecture is formulated, core challenges enumerated, and results reported based on a simple prototype and trace-driven simulations. These results suggest that the overhead is manageable and that a more comprehensive investigation is worthwhile. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.micpro.2006.02.020 | Microprocessors and Microsystems |
Keywords | Field | DocType |
FPGA,Reconfigurable computing,Run-time reconfiguration,Online architecture | Online algorithm,Architecture,Reduced cost,Profiling (computer programming),Computer science,Parallel computing,Field-programmable gate array,Real-time computing,Control reconfiguration,Power consumption,Reconfigurable computing,Embedded system | Journal |
Volume | Issue | ISSN |
30 | 6 | 0141-9331 |
Citations | PageRank | References |
0 | 0.34 | 16 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ron Sass | 1 | 72 | 11.27 |
| Brian Greskamp | 2 | 229 | 10.92 |
| Brian Leonard | 3 | 1 | 0.69 |
| Jeff Young | 4 | 0 | 0.34 |
| Srinivas Beeravolu | 5 | 40 | 3.81 |