|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/4686
|
| タイトル: | Assignment-Driven Loop Pipeline Scheduling and Its Application to Data-Path Synthesis |
| 著者: | YOROZUYA, Toshiyuki
OHASHI, Koji
KANEKO, Mineo |
| キーワード: | data-path synthesis
resource assignment
loop pipeline scheduling
dependence graph
disjunctive arc |
| 発行日: | 2002-04-01 |
| 出版者: | 電子情報通信学会 |
| 誌名: | IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences |
| 巻: | E85-A |
| 号: | 4 |
| 開始ページ: | 819 |
| 終了ページ: | 826 |
| 抄録: | In this paper, we study loop pipeline scheduling problem under given resource assignment (operation to functional unit assignments and data to register assignments), which is one of the key tasks in data-path synthesis based on the assignment solution space exploration. We show an approach using a precedence constraint graph with parametric disjunctive arcs generated from the specified assignment information, and derive a scheduling method using branch-and-bound exploration of the parameter space. As an application of the proposed scheduling method, it is incorporated with Simulated-Annealing (SA) based exploration of assignment solution space, and it is demonstrated that data-paths of the fifth-order elliptic wave filter are successfully synthesized. |
| Rights: | Copyright (C)2002 IEICE. Toshiyuki Yorozuya, Koji Ohashi, Mineo Kaneko, IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E85-A(4), 2002, 819-826. http://www.ieice.org/jpn/trans_online/ |
| URI: | http://hdl.handle.net/10119/4686 |
| 資料タイプ: | publisher |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 2607.pdf | | 525Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
