一种新的专用集成电路设计调度方法

Chi-Ho Lin, Jin-Chun Kim
{"title":"一种新的专用集成电路设计调度方法","authors":"Chi-Ho Lin, Jin-Chun Kim","doi":"10.1109/IWSOC.2006.348222","DOIUrl":null,"url":null,"abstract":"This paper presents a new VHDL intermediate format CDFG (control data flow graph) and a minimal hardware resource scheduling algorithm for ASIC design automation. The intermediate format, CDFG represents the constraints which limit hardware design such as conditional branch, sequential operation and time constraints. The proposed scheduling algorithm could handle the conditional branches effectively and could check the timing constraints efficiently. It minimizes the total operating time by reducing the number of the constraints as maximal as possible, determining the number of control steps in minimum bound. The effectiveness of the proposed algorithm has been proven by the experiment with the benchmark examples","PeriodicalId":134742,"journal":{"name":"2006 6th International Workshop on System on Chip for Real Time Applications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Novel Scheduling methodology for ASIC Design\",\"authors\":\"Chi-Ho Lin, Jin-Chun Kim\",\"doi\":\"10.1109/IWSOC.2006.348222\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new VHDL intermediate format CDFG (control data flow graph) and a minimal hardware resource scheduling algorithm for ASIC design automation. The intermediate format, CDFG represents the constraints which limit hardware design such as conditional branch, sequential operation and time constraints. The proposed scheduling algorithm could handle the conditional branches effectively and could check the timing constraints efficiently. It minimizes the total operating time by reducing the number of the constraints as maximal as possible, determining the number of control steps in minimum bound. The effectiveness of the proposed algorithm has been proven by the experiment with the benchmark examples\",\"PeriodicalId\":134742,\"journal\":{\"name\":\"2006 6th International Workshop on System on Chip for Real Time Applications\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 6th International Workshop on System on Chip for Real Time Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWSOC.2006.348222\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 6th International Workshop on System on Chip for Real Time Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSOC.2006.348222","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

针对ASIC设计自动化,提出了一种新的VHDL中间格式CDFG(控制数据流图)和一种最小硬件资源调度算法。中间格式CDFG表示限制硬件设计的约束,如条件分支、顺序操作和时间约束。所提出的调度算法能有效地处理条件分支,并能有效地检查时序约束。它通过最大限度地减少约束的数量,确定最小界内的控制步数,从而使总操作时间最小化。通过基准算例的实验验证了该算法的有效性
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Scheduling methodology for ASIC Design
This paper presents a new VHDL intermediate format CDFG (control data flow graph) and a minimal hardware resource scheduling algorithm for ASIC design automation. The intermediate format, CDFG represents the constraints which limit hardware design such as conditional branch, sequential operation and time constraints. The proposed scheduling algorithm could handle the conditional branches effectively and could check the timing constraints efficiently. It minimizes the total operating time by reducing the number of the constraints as maximal as possible, determining the number of control steps in minimum bound. The effectiveness of the proposed algorithm has been proven by the experiment with the benchmark examples
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信