TY - JOUR
T1 - Efficient datapath merging for the overhead reduction of run-time reconfigurable systems
AU - Zakerolhosseini, Ali
AU - Gaydadjiev, Georgi
N1 - Funding Information:
Acknowledgements The authors would like to thank the Iran Telecommunication Research Center (ITRC) and Hartes project for supporting this research in the context of the project T/500/3462 and project EU-IST-035143, respectively.
PY - 2012/2
Y1 - 2012/2
N2 - High latencies in FPGA reconfiguration are known as a major overhead in run-time reconfigurable systems. This overhead can be reduced by merging multiple data flow graphs representing different kernels of the original program into a single (merged) datapath that will be configured less often compared to the separate datapaths scenario. However, the additional hardware introduced by this technique increases the kernels execution time. In this paper, we present a novel datapath merging technique that reduces both the configuration and execution times of kernels mapped on the reconfigurable fabric. Experimental results show up to 13% reduction in the configuration and execution times of kernels from media-bench workloads, compared to previous art on datapath merging. When compared to conventional high-level synthesis algorithms, our proposal reduces kernels configuration and execution times by up to 48%.
AB - High latencies in FPGA reconfiguration are known as a major overhead in run-time reconfigurable systems. This overhead can be reduced by merging multiple data flow graphs representing different kernels of the original program into a single (merged) datapath that will be configured less often compared to the separate datapaths scenario. However, the additional hardware introduced by this technique increases the kernels execution time. In this paper, we present a novel datapath merging technique that reduces both the configuration and execution times of kernels mapped on the reconfigurable fabric. Experimental results show up to 13% reduction in the configuration and execution times of kernels from media-bench workloads, compared to previous art on datapath merging. When compared to conventional high-level synthesis algorithms, our proposal reduces kernels configuration and execution times by up to 48%.
KW - Datapath merging
KW - Reconfigurable computing
KW - Run-time reconfigurable systems
UR - http://www.scopus.com/inward/record.url?scp=84855695038&partnerID=8YFLogxK
U2 - 10.1007/s11227-010-0458-3
DO - 10.1007/s11227-010-0458-3
M3 - Article
AN - SCOPUS:84855695038
SN - 0920-8542
VL - 59
SP - 636
EP - 657
JO - Journal of Supercomputing
JF - Journal of Supercomputing
IS - 2
ER -