loading...
Considering Run-Time Reconfiguration Overhead in Task Graph Transformations for Dynamically Reconfigurable Architectures
Los Alamitos April 18-April 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FCCM.2005.2813th Annual IEEE Symposium on Field-P ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sudarshan Banerjee, University of California at Irvine
Elaheh Bozorgzadeh, University of California at Irvine
Nikil Dutt, University of California at Irvine
In modern dynamic FPGA-based platforms where multiple processes may be executing concurrently, partial dynamic reconfiguration (RTR) is a key technique for maximizing application performance under resource constraints. For platforms with columnbased partial RTR, we propose a new technique to statically transform linear task graphs (common in image processing applications). In our approach, the granularity of data parallelism for each task is determined while considering the reconfiguration overhead along with architectural constraints imposed by partial RTR. On JPEG applications, our technique can improve the execution time by upto 37% by choosing the right granularity of task parallelism.
Citation:
Sudarshan Banerjee, Elaheh Bozorgzadeh, Nikil Dutt, "Considering Run-Time Reconfiguration Overhead in Task Graph Transformations for Dynamically Reconfigurable Architectures," fccm, pp.273-274, 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.