在高级综合中利用冲突和兼容性图的特殊结构

1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers Pub Date : 1990-11-11 DOI:10.1109/ICCAD.1990.129895

D. Springer, D. E. Thomas

{"title":"在高级综合中利用冲突和兼容性图的特殊结构","authors":"D. Springer, D. E. Thomas","doi":"10.1109/ICCAD.1990.129895","DOIUrl":null,"url":null,"abstract":"Two types of graphs are presented: chordal graphs and comparability graphs. Chordal graphs guarantee a minimum number of registers on a larger number of designs. Comparability graphs reduce the complexity and improve clique partitioning algorithms used in high-level synthesis.<<ETX>>","PeriodicalId":242666,"journal":{"name":"1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"46","resultStr":"{\"title\":\"Exploiting the special structure of conflict and compatibility graphs in high-level synthesis\",\"authors\":\"D. Springer, D. E. Thomas\",\"doi\":\"10.1109/ICCAD.1990.129895\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two types of graphs are presented: chordal graphs and comparability graphs. Chordal graphs guarantee a minimum number of registers on a larger number of designs. Comparability graphs reduce the complexity and improve clique partitioning algorithms used in high-level synthesis.<<ETX>>\",\"PeriodicalId\":242666,\"journal\":{\"name\":\"1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-11-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"46\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCAD.1990.129895\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCAD.1990.129895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 46

摘要

给出了两种类型的图:弦图和可比性图。弦图保证了在大量的设计中寄存器的最少数量。可比性图降低了复杂性，并改进了高级合成中使用的团划分算法

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Exploiting the special structure of conflict and compatibility graphs in high-level synthesis

Two types of graphs are presented: chordal graphs and comparability graphs. Chordal graphs guarantee a minimum number of registers on a larger number of designs. Comparability graphs reduce the complexity and improve clique partitioning algorithms used in high-level synthesis.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers

自引率

0.00%

发文量