{"title":"复杂条件结构数据路径调度的一种启发式方法","authors":"S. Nakamura, A. Yamada, I. Shirakawa","doi":"10.1109/TENCON.1995.496361","DOIUrl":null,"url":null,"abstract":"This paper proposes a new heuristic approach to the time-constrained datapath scheduling with complex conditional structures. This algorithm intends to select the best of all solutions attained by the iterative refinement process. Experimental results demonstrate that this algorithm attains optimal results in most cases and can be applied to a practical scale of datapath scheduling.","PeriodicalId":425138,"journal":{"name":"1995 IEEE TENCON. IEEE Region 10 International Conference on Microelectronics and VLSI. 'Asia-Pacific Microelectronics 2000'. Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A heuristic approach to datapath scheduling of complex conditional structure\",\"authors\":\"S. Nakamura, A. Yamada, I. Shirakawa\",\"doi\":\"10.1109/TENCON.1995.496361\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new heuristic approach to the time-constrained datapath scheduling with complex conditional structures. This algorithm intends to select the best of all solutions attained by the iterative refinement process. Experimental results demonstrate that this algorithm attains optimal results in most cases and can be applied to a practical scale of datapath scheduling.\",\"PeriodicalId\":425138,\"journal\":{\"name\":\"1995 IEEE TENCON. IEEE Region 10 International Conference on Microelectronics and VLSI. 'Asia-Pacific Microelectronics 2000'. Proceedings\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1995 IEEE TENCON. IEEE Region 10 International Conference on Microelectronics and VLSI. 'Asia-Pacific Microelectronics 2000'. Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENCON.1995.496361\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1995 IEEE TENCON. IEEE Region 10 International Conference on Microelectronics and VLSI. 'Asia-Pacific Microelectronics 2000'. Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.1995.496361","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A heuristic approach to datapath scheduling of complex conditional structure
This paper proposes a new heuristic approach to the time-constrained datapath scheduling with complex conditional structures. This algorithm intends to select the best of all solutions attained by the iterative refinement process. Experimental results demonstrate that this algorithm attains optimal results in most cases and can be applied to a practical scale of datapath scheduling.