A new datapath merging method for reconfigurable system

Mohammad K. Fallah, Mahdy Zolghadr, Ali Zakerolhosseini

Research output: Contribution to journalConference articlepeer-review

11 Citations (Scopus)


Reconfigurable systems have been proved to achieve significant performance speed-up by mapping the most time-consuming loops to a reconfigur- able units. Datapath merging (DPM) synthesis has identified the similarities among the Data Flow Graphs (DFGs) corresponding to the loops, and produces a single reconfigurable datapath that can be dynamically reconfigured to execute each DFG. This paper presents a new datapath merging method that produces a reconfigurable datapath with minimal area usage. At first it merges DFGs together one by one to create the reconfigurable datapath. Then it merges the functional units and interconnection units inside the reconfigurable datapath to reduce resource area usage. To do this, a new graph-based technique to merge the resources in the reconfigurable datapath is presented. We evaluate the proposed method using programs from the Media-bench benchmarks and experimental results show a decrease from 5% to 15% in reconfigurable data path resource area in comparison to previous algorithms.

Original languageEnglish
Pages (from-to)157-168
Number of pages12
JournalLecture Notes in Computer Science (LNCS)
Publication statusPublished - 2009
Externally publishedYes
Event5th International Workshop of Applied Reconfigurable Computing, ARC 2009 - Karlsruhe, United States
Duration: 16 Mar 200918 Mar 2009


  • Datapath merging
  • High level synthesis
  • Maximum weighted clique algorithm
  • Reconfigurable computing


Dive into the research topics of 'A new datapath merging method for reconfigurable system'. Together they form a unique fingerprint.

Cite this