Reconfiguration Overhead Reduction and Hiding of Run-Time Reconfigurable System
碩士 === 國立交通大學 === 資訊工程系 === 92 === In run-time reconfigurable system, the whole partial reconfigurable hardware is viewed as a reconfiguration and execution unit traditionally. Therefore, execution cannot start until the finish reconfiguration of the whole partial reconfigurable hardware....
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/72639710189266801319 |
id |
ndltd-TW-092NCTU0392001 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-092NCTU03920012016-06-17T04:16:03Z http://ndltd.ncl.edu.tw/handle/72639710189266801319 Reconfiguration Overhead Reduction and Hiding of Run-Time Reconfigurable System 在應用執行過程中可重新設定組態系統中重新設定時間的減少與隱藏 Chi-Hua Tseng 曾啟華 碩士 國立交通大學 資訊工程系 92 In run-time reconfigurable system, the whole partial reconfigurable hardware is viewed as a reconfiguration and execution unit traditionally. Therefore, execution cannot start until the finish reconfiguration of the whole partial reconfigurable hardware. We virtually divide the partial reconfigurable hardware into several equal-size blocks. The reconfiguration and execution unit is smaller. This can make reconfiguration of one block overlap with execution of other blocks. And this can hide some reconfiguration overhead. Doing so will bring a new problem which is partitions-to-blocks scheduling. We design a two phases scheduler. Phase I will generate one highest priority partition from un-scheduled partitions. There are three considerations of the partition’s priority. One is the partition is on current critical path or not. Another is the number of outgoing edges and released partitions of the partition. The other is the execution time of the partition. We have two partition selection policies including of critical first and utilization first. Phase II will assign one block to the highest priority partition generated from Phase I. If the partition is the latest partition, we will assign one block to the partition so that the partition can finish execution earliest. If the partition is not the latest partition, we will look ahead one next future partition into consideration together. Choose one block to the primary partition so that these two partitions can release maximal resource with time. The result shows that utilization first is better than critical first. And view a part of the whole partial reconfigurable hardware as a reconfiguration and execution unit can improve completion time of run-time reconfigurable system. Chung-Ping Chung 鍾崇斌 2003 學位論文 ; thesis 72 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 資訊工程系 === 92 === In run-time reconfigurable system, the whole partial reconfigurable hardware is viewed as a reconfiguration and execution unit traditionally. Therefore, execution cannot start until the finish reconfiguration of the whole partial reconfigurable hardware. We virtually divide the partial reconfigurable hardware into several equal-size blocks. The reconfiguration and execution unit is smaller. This can make reconfiguration of one block overlap with execution of other blocks. And this can hide some reconfiguration overhead.
Doing so will bring a new problem which is partitions-to-blocks scheduling. We design a two phases scheduler. Phase I will generate one highest priority partition from un-scheduled partitions. There are three considerations of the partition’s priority. One is the partition is on current critical path or not. Another is the number of outgoing edges and released partitions of the partition. The other is the execution time of the partition. We have two partition selection policies including of critical first and utilization first. Phase II will assign one block to the highest priority partition generated from Phase I. If the partition is the latest partition, we will assign one block to the partition so that the partition can finish execution earliest. If the partition is not the latest partition, we will look ahead one next future partition into consideration together. Choose one block to the primary partition so that these two partitions can release maximal resource with time.
The result shows that utilization first is better than critical first. And view a part of the whole partial reconfigurable hardware as a reconfiguration and execution unit can improve completion time of run-time reconfigurable system.
|
author2 |
Chung-Ping Chung |
author_facet |
Chung-Ping Chung Chi-Hua Tseng 曾啟華 |
author |
Chi-Hua Tseng 曾啟華 |
spellingShingle |
Chi-Hua Tseng 曾啟華 Reconfiguration Overhead Reduction and Hiding of Run-Time Reconfigurable System |
author_sort |
Chi-Hua Tseng |
title |
Reconfiguration Overhead Reduction and Hiding of Run-Time Reconfigurable System |
title_short |
Reconfiguration Overhead Reduction and Hiding of Run-Time Reconfigurable System |
title_full |
Reconfiguration Overhead Reduction and Hiding of Run-Time Reconfigurable System |
title_fullStr |
Reconfiguration Overhead Reduction and Hiding of Run-Time Reconfigurable System |
title_full_unstemmed |
Reconfiguration Overhead Reduction and Hiding of Run-Time Reconfigurable System |
title_sort |
reconfiguration overhead reduction and hiding of run-time reconfigurable system |
publishDate |
2003 |
url |
http://ndltd.ncl.edu.tw/handle/72639710189266801319 |
work_keys_str_mv |
AT chihuatseng reconfigurationoverheadreductionandhidingofruntimereconfigurablesystem AT céngqǐhuá reconfigurationoverheadreductionandhidingofruntimereconfigurablesystem AT chihuatseng zàiyīngyòngzhíxíngguòchéngzhōngkězhòngxīnshèdìngzǔtàixìtǒngzhōngzhòngxīnshèdìngshíjiāndejiǎnshǎoyǔyǐncáng AT céngqǐhuá zàiyīngyòngzhíxíngguòchéngzhōngkězhòngxīnshèdìngzǔtàixìtǒngzhōngzhòngxīnshèdìngshíjiāndejiǎnshǎoyǔyǐncáng |
_version_ |
1718306984059469824 |