adrli_ReConFig12

Minimization of Average Execution Time Based on Speculative FPGA Configuration Prefetch

Adrian Lifa
 
Petru Eles Author homepage
Zebo Peng Author homepage

International Conference on ReConFigurable Computing and FPGAs (ReConFig 2012), Cancun, Mexico, December 5-7, 2012.

ABSTRACT
One of the main drawbacks that significantly impacts the performance of dynamically reconfigurable systems (like FPGAs), is their high reconfiguration overhead. Configuration prefetching is one method to reduce this penalty by overlapping FPGA reconfigurations with useful computations. In this paper we propose a speculative approach that schedules prefetches at design time and simultaneously performs HW/SW partitioning, in order to minimize the expected execution time of an application. Our method prefetches and executes in hardware those configurations that provide the highest performance improvement. The algorithm takes into consideration profiling information (such as branch probabilities and execution time distributions), correlated with the application characteristics. Compared to the previous state-of-art, we reduce the reconfiguration penalty with 34% on average, and with up to 59% for particular case studies.


Related files:
adrli_ReConFig12.pdfAdobe Acrobat portable document


[LEP12] Adrian Lifa, Petru Eles, Zebo Peng, "Minimization of Average Execution Time Based on Speculative FPGA Configuration Prefetch", International Conference on ReConFigurable Computing and FPGAs (ReConFig 2012), Cancun, Mexico, December 5-7, 2012.
( ! ) perl script by Giovanni Squillero with modifications from Gert Jervan   (v3.1, p5.2, September-2002-)
Last modified on Monday December 04, 2006 by Gert Jervan