This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2010 18th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines
Interprocedural Placement-Aware Configuration Prefetching for FPGA-Based Systems
Charlotte, North Carolina, USA
May 02-May 04
ISBN: 978-0-7695-4056-6
One of the major impediments to deploying partially run-time reconfigurable FPGAs as hardware accelerators is the time overhead involved in loading the hardware modules. While configuration prefetching is an effective method that can be employed to reduce this overhead, mispredicted prefetches may worsen the situation by increasing the number of reconfigurations needed. In this paper, we present a static algorithm for configuration prefetching in partially reconfigurable FPGAs that minimizes the reconfiguration overhead. By making use of profiling, the interprocedural control flow graph, and the placement information of hardware modules, our algorithm predicts hardware execution and tries to prefetch hardware modules as early as possible while minimizing the risk of mis-predictions. Our experiments show that our algorithm performs significantly better than current state-of-the-art prefetching algorthms for control-bound applications.
Index Terms:
FPGA, Interprocedural, Configuration Prefetching, Control-Flow, Compilers
Citation:
Joon Edward Sim, Weng-Fai Wong, Gregor Walla, Tobias Ziermann, Jürgen Teich, "Interprocedural Placement-Aware Configuration Prefetching for FPGA-Based Systems," fccm, pp.179-182, 2010 18th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, 2010
Usage of this product signifies your acceptance of the Terms of Use.