{"title":"优化的DSP汇编代码生成从同构原子数据流图开始","authors":"B. Wess, W. Kreuzer","doi":"10.1109/MWSCAS.1995.510327","DOIUrl":null,"url":null,"abstract":"The problem of translating graphs into optimal instruction code is NP-complete even for very simple target machine models. On the other hand, O(n) algorithms are available for translating expression trees into optimal instruction code. The purpose of this paper is to show that by transforming graphs into constrained expression trees, global optimized instruction code can be produced based on tree algorithms.","PeriodicalId":165081,"journal":{"name":"38th Midwest Symposium on Circuits and Systems. Proceedings","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Optimized DSP assembly code generation starting from homogeneous atomic data flow graphs\",\"authors\":\"B. Wess, W. Kreuzer\",\"doi\":\"10.1109/MWSCAS.1995.510327\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of translating graphs into optimal instruction code is NP-complete even for very simple target machine models. On the other hand, O(n) algorithms are available for translating expression trees into optimal instruction code. The purpose of this paper is to show that by transforming graphs into constrained expression trees, global optimized instruction code can be produced based on tree algorithms.\",\"PeriodicalId\":165081,\"journal\":{\"name\":\"38th Midwest Symposium on Circuits and Systems. Proceedings\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"38th Midwest Symposium on Circuits and Systems. Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MWSCAS.1995.510327\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"38th Midwest Symposium on Circuits and Systems. Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.1995.510327","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimized DSP assembly code generation starting from homogeneous atomic data flow graphs
The problem of translating graphs into optimal instruction code is NP-complete even for very simple target machine models. On the other hand, O(n) algorithms are available for translating expression trees into optimal instruction code. The purpose of this paper is to show that by transforming graphs into constrained expression trees, global optimized instruction code can be produced based on tree algorithms.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
