Handling Control Data Flow Graphs for a Tightly Coupled Reconfigurable Accelerator

  • Hamid Noori Morteza Saheb Zamani, Koji Inoue, and Kazuaki Murakami F
  • 9

    Readers

    Mendeley users who have this article in their library.
  • 1

    Citations

    Citations of this article.

Abstract

In an embedded system including a base processor integrated with a tightly coupled accelerator, extracting frequently executed portions of the code (hot portion) and executing their corresponding data flow graph (DFG) on the accelerator brings about more speedup. In this paper, we intend to present our motivations for handling control instructions in DFGs and extending them to Control DFGs (CDFGs). In addition, basic requirements for an accelerator with conditional execution support are proposed. Moreover, some algorithms are presented for temporal partitioning of CDFGs considering the target accelerator architectural specifications. To show the effectiveness of the proposed ideas, we applied them to the accelerator of an extensible processor called AMBER. Experimental results represent the effectiveness of covering control instructions and using CDFGs versus DFGs.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Farhad Mehdipour Hamid Noori Morteza Saheb Zamani, Koji Inoue, and Kazuaki Murakami

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free