<会議発表論文>
GifT:A Gravity-Directed and Life-Time Based Algorithm for Temporal Partitioning of Data Flow Graphs

作成者
本文言語
出版者
発行日
雑誌名
雑誌名
開始ページ
終了ページ
出版タイプ
アクセス権
JaLC DOI
概要 In reconfigurable systems, reconfiguration latency has a significant impact on the system performance. In this work, a temporal partitioning algorithm is presented to partition data flow graphs for re...configurable computing systems. Life-time of a node in a data flow graph represents the number of times it executes during the application run. A new factor, called residing eligibility, inspired from the Universal gravitation law, is introduced to depict the eligibility of a node to stay in succeeding partitions and to prohibit it from being swapped in/out. Life-time, size, and distance of a node from the nearest identical node in the data flow graph are important factors for determining its residing eligibility. Assigning nodes to a partition according to their residing eligibility can cause fewer nodes with different functionalities to be assigned to subsequent partitions. Thus, reconfiguration overhead time and also wasted hardware space decreases due to common parts in subsequent configurations on a partially programmable hardware.続きを見る

本文情報を非表示

farhad06_1 pdf 223 KB 133  

詳細

レコードID
査読有無
関連情報
主題
タイプ
登録日 2008.01.22
更新日 2017.03.21