Online Task Scheduling and Placement Algorithm for Reconfigurable FPGA
碩士 === 大同大學 === 資訊工程學系(所) === 103 === Nowadays, we can see embedded system everwhere, like as multimedia, portable player, embedded treatment devices ect. In the future, chip area will be smaller, and the capability will be harder. for the reason, use chip to get higher efficacy is important. In thi...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/98849569065325408001 |
| Summary: | 碩士 === 大同大學 === 資訊工程學系(所) === 103 === Nowadays, we can see embedded system everwhere, like as multimedia, portable player, embedded treatment devices ect.
In the future, chip area will be smaller, and the capability will be harder. for the reason, use chip to get higher efficacy is important.
In this paper, we will introduce how the reconfigurable system to run, and summarize three problems which on online system, and how we to slove these problems.
In the end, we found the First Fit is batter than Best Fit.
|
|---|