A Formal Approach to the Slack Driven Scheduling Problem in High Level Synthesis
碩士 === 中原大學 === 電子工程研究所 === 93 === With the advent of deep sub-micron era, there is a growing need to consider the design closure problem in high-level synthesis. Previous work has shown that the slack (in terms of the number of clock cycles) is an effective means of tolerating variations in operati...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/ae6wjr |
| id |
ndltd-TW-093CYCU5428028 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-093CYCU54280282019-05-15T20:05:51Z http://ndltd.ncl.edu.tw/handle/ae6wjr A Formal Approach to the Slack Driven Scheduling Problem in High Level Synthesis 鬆弛時間最佳化之運算排序 Chun-Hua Cheng 程駿華 碩士 中原大學 電子工程研究所 93 With the advent of deep sub-micron era, there is a growing need to consider the design closure problem in high-level synthesis. Previous work has shown that the slack (in terms of the number of clock cycles) is an effective means of tolerating variations in operation delays. In this paper, we propose an integer linear programming (ILP) approach for the slack driven scheduling problem. Our objective is to maximize the total useable slack under the design constraints (timing and resource). Compared with previous work [4], our approach has the following two advantages: first, our approach guarantees the optimality; secondly, our approach is more suitable for the design space exploration. Shih-Hsu Huang 黃世旭 2005 學位論文 ; thesis 57 zh-TW |
| collection |
NDLTD |
| language |
zh-TW |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 中原大學 === 電子工程研究所 === 93 === With the advent of deep sub-micron era, there is a growing need to consider the design closure problem in high-level synthesis. Previous work has shown that the slack (in terms of the number of clock cycles) is an effective means of tolerating variations in operation delays. In this paper, we propose an integer linear programming (ILP) approach for the slack driven scheduling problem. Our objective is to maximize the total useable slack under the design constraints (timing and resource). Compared with previous work [4], our approach has the following two advantages: first, our approach guarantees the optimality; secondly, our approach is more suitable for the design space exploration.
|
| author2 |
Shih-Hsu Huang |
| author_facet |
Shih-Hsu Huang Chun-Hua Cheng 程駿華 |
| author |
Chun-Hua Cheng 程駿華 |
| spellingShingle |
Chun-Hua Cheng 程駿華 A Formal Approach to the Slack Driven Scheduling Problem in High Level Synthesis |
| author_sort |
Chun-Hua Cheng |
| title |
A Formal Approach to the Slack Driven Scheduling Problem in High Level Synthesis |
| title_short |
A Formal Approach to the Slack Driven Scheduling Problem in High Level Synthesis |
| title_full |
A Formal Approach to the Slack Driven Scheduling Problem in High Level Synthesis |
| title_fullStr |
A Formal Approach to the Slack Driven Scheduling Problem in High Level Synthesis |
| title_full_unstemmed |
A Formal Approach to the Slack Driven Scheduling Problem in High Level Synthesis |
| title_sort |
formal approach to the slack driven scheduling problem in high level synthesis |
| publishDate |
2005 |
| url |
http://ndltd.ncl.edu.tw/handle/ae6wjr |
| work_keys_str_mv |
AT chunhuacheng aformalapproachtotheslackdrivenschedulingprobleminhighlevelsynthesis AT chéngjùnhuá aformalapproachtotheslackdrivenschedulingprobleminhighlevelsynthesis AT chunhuacheng sōngchíshíjiānzuìjiāhuàzhīyùnsuànpáixù AT chéngjùnhuá sōngchíshíjiānzuìjiāhuàzhīyùnsuànpáixù AT chunhuacheng formalapproachtotheslackdrivenschedulingprobleminhighlevelsynthesis AT chéngjùnhuá formalapproachtotheslackdrivenschedulingprobleminhighlevelsynthesis |
| _version_ |
1719096165528502272 |