| 作成者 |
|
|
|
|
|
|
|
| 本文言語 |
|
| 発行日 |
|
| 収録物名 |
|
| 収録物名 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
Using an extensible processor in which data flow graphs (DFGs) are generated from frequently executed portions (hot portions) of applications and are executed after chip-fabrication provides flexibili...ty as well as addressing the time-to-market and significant nonrecurring engineering costs issues. In this paper, the effect of extending DFGs to control data flow graphs (CDFGs) through covering control instructions on the speedup is studied. Moreover, basic requirements for an accelerator with conditional execution support are presented. A temporal partitioning algorithm is introduced to partition the large CDFGs to smaller mappable ones under the accelerator resource constraints. To demonstrate effectiveness of the proposed ideas, they are applied to the accelerator of an extensible processor called AMBER which utilizes a matrix of functional units to accelerate the execution of the DFGs. Experimental results approve the considerable effectiveness of covering control instructions and using CDFGs versus DFGs in the aspects of performance and energy reduction.続きを見る
|
Mendeley出力
farhad07_1