頁籤選單縮合
| 題 名 | High-Level Synthesis of Shared-Bus Systems from Data-Flow Graphs=資料流動圖之共用匯流排系統高階設計 |
|---|---|
| 作 者 | 蔡中川; 何業勤; | 書刊名 | Proceedings of the National Science Council : Part A, Physical Science and Engineering |
| 卷 期 | 23:1 1999.01[民88.01] |
| 頁 次 | 頁133-142 |
| 分類號 | 312.1 |
| 關鍵詞 | 資料流動圖; 共用匯流排系統; Data-flow graphs; High-level synthesis; Integer linear programming; Resource allocation; Scheduling; Unfolding; |
| 語 文 | 英文(English) |
| 英文摘要 | A shared-bus system consists of multiple buses shared by multiple functional units. Two important problems involved in the high-level synthesis of such a system are: the scheduling problem and the resource allocation problem for a given data-flow graph (DFG). This paper proposes methods to optimally solve these two problems. The proposed methods are applicable to both non-iterative DFGs and iterative DFGs with non-unitary communication and computation times. To solve the scheduling problem, we introduce the extended DFG so that both computations and communications can be scheduled simultaneously to functional units and interconnection buses in a single integer linear programming formulation. To solve the resource allocation problem, we apply techniques of integer linear programming, circular-arc coloring, and channel assignment. |
本系統中英文摘要資訊取自各篇刊載內容。