{"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}
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