Register-to-Register Data Transfer Optimization in Loop Folding Scheduling

Bibliographic Information

Other Title
  • ループフォールディングスケジューリングにおけるレジスタ間データ転送コストの最小化

Search this article

Description

In high level synthesis, Scheduling is an important stage which assigns each operation appeared in a data flow graph to a specific control step, of which results influence the design quality directly. This paper describes a time constrainted loop folding scheduling. Since no previous approaches estimate the inter connection cost between registers (register-to-register cost) for loop folding scheduling, our approach introduces a datapath model with the interconnection between registers across buses for register-to-operation, and minimizes the total hardware cost including the register-to-register cost with the Force-Directed Scheduling.

Journal

References(8)*help

See more

Details 詳細情報について

  • CRID
    1574231877167105408
  • NII Article ID
    110003179901
  • NII Book ID
    AN10013141
  • Text Lang
    ja
  • Data Source
    • CiNii Articles

Report a problem

Back to top