TY - GEN
T1 - High speed merged-datapath design for run-time reconfigurable systems
AU - Zakerolhosseini, Ali
AU - Shahbahrami, Asadollah
AU - Gaydadjiev, Georgi
PY - 2009
Y1 - 2009
N2 - Datapath merging is an efficient high level synthesis method to merge Data Flow Graphs (DFGs), corresponding to two or more computational intensive loops. This process creates a general purpose datapaths (merged datapaths) instead of multiple datapaths that results in shorter bit-stream length and therefore reduces the configuration time in reconfigurable systems. The merged datapath, however has worse loop execution time. This paper represents two datapath merging algorithms to address this problem. These algorithms consider the impact of adding multiplexer's latency to the critical path delay of the merged datapath. The former algorithm merges DFGs from the biggest DFG to the smallest one to make high speed merged datapath. The latter merges DFGs in steps, and in the final step, it combines the resources inside the merged datapath to achieve additional reduction in configuration time. The proposed techniques are evaluated using several Mediabench applications. The experimental results show a significant reduction, up to 35% in loops execution time for the first algorithm and up to 27% reduction for the second algorithm in comparison to previous datapath merging algorithm.
AB - Datapath merging is an efficient high level synthesis method to merge Data Flow Graphs (DFGs), corresponding to two or more computational intensive loops. This process creates a general purpose datapaths (merged datapaths) instead of multiple datapaths that results in shorter bit-stream length and therefore reduces the configuration time in reconfigurable systems. The merged datapath, however has worse loop execution time. This paper represents two datapath merging algorithms to address this problem. These algorithms consider the impact of adding multiplexer's latency to the critical path delay of the merged datapath. The former algorithm merges DFGs from the biggest DFG to the smallest one to make high speed merged datapath. The latter merges DFGs in steps, and in the final step, it combines the resources inside the merged datapath to achieve additional reduction in configuration time. The proposed techniques are evaluated using several Mediabench applications. The experimental results show a significant reduction, up to 35% in loops execution time for the first algorithm and up to 27% reduction for the second algorithm in comparison to previous datapath merging algorithm.
UR - http://www.scopus.com/inward/record.url?scp=77949389601&partnerID=8YFLogxK
U2 - 10.1109/FPT.2009.5377678
DO - 10.1109/FPT.2009.5377678
M3 - Conference contribution
AN - SCOPUS:77949389601
SN - 9781424443772
T3 - Proceedings of the 2009 International Conference on Field-Programmable Technology, FPT'09
SP - 339
EP - 343
BT - Proceedings of the 2009 International Conference on Field-Programmable Technology, FPT'09
T2 - 2009 International Conference on Field-Programmable Technology, FPT'09
Y2 - 9 December 2009 through 11 December 2009
ER -