完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Hsiao, PY | en_US |
dc.contributor.author | Wu, GM | en_US |
dc.contributor.author | Su, JY | en_US |
dc.date.accessioned | 2014-12-08T15:47:25Z | - |
dc.date.available | 2014-12-08T15:47:25Z | - |
dc.date.issued | 1998-11-01 | en_US |
dc.identifier.issn | 1350-2387 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/31789 | - |
dc.description.abstract | A branch-and-bound algorithm based on a maximum possibility table (MPT) is proposed to solve scheduling problems in high-level synthesis. Six efficient priority rules are developed as bounding functions in the algorithm. Extensions for real-world constraints are also considered, including chained operations, multicycle operations, mutually exclusive operations and pipelined data paths. Experimental results indicate that the MPT-based algorithm returns competitive scheduling results at significant savings in execution time as compared with other methods. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | scheduling problem | en_US |
dc.subject | high-level synthesis | en_US |
dc.subject | MPT | en_US |
dc.title | MPT-based branch-and-bound strategy for scheduling problem in high-level synthesis | en_US |
dc.type | Article | en_US |
dc.identifier.journal | IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES | en_US |
dc.citation.volume | 145 | en_US |
dc.citation.issue | 6 | en_US |
dc.citation.spage | 425 | en_US |
dc.citation.epage | 432 | en_US |
dc.contributor.department | 電機資訊學士班 | zh_TW |
dc.contributor.department | Undergraduate Honors Program of Electrical Engineering and Computer Science | en_US |
dc.identifier.wosnumber | WOS:000078448400008 | - |
dc.citation.woscount | 2 | - |
顯示於類別: | 期刊論文 |