时序分析的路径选择算法

25th ACM/IEEE, Design Automation Conference.Proceedings 1988. Pub Date : 1988-06-01 DOI:10.1109/DAC.1988.14850

H. C. Yen, S. Ghanta, D. Du

{"title":"时序分析的路径选择算法","authors":"H. C. Yen, S. Ghanta, D. Du","doi":"10.1109/DAC.1988.14850","DOIUrl":null,"url":null,"abstract":"Existing algorithms for timing analysis have difficulties when dealing with large designs. A novel algorithm for timing analysis is proposed that enumerates all the paths with delay greater than a given threshold. The execution time of the proposed algorithm is proportional to the number of paths generated, so it is suitable for large designs.<<ETX>>","PeriodicalId":230716,"journal":{"name":"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"A path selection algorithm for timing analysis\",\"authors\":\"H. C. Yen, S. Ghanta, D. Du\",\"doi\":\"10.1109/DAC.1988.14850\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Existing algorithms for timing analysis have difficulties when dealing with large designs. A novel algorithm for timing analysis is proposed that enumerates all the paths with delay greater than a given threshold. The execution time of the proposed algorithm is proportional to the number of paths generated, so it is suitable for large designs.<<ETX>>\",\"PeriodicalId\":230716,\"journal\":{\"name\":\"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1988.14850\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1988.14850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 26

摘要

现有的时序分析算法在处理大型设计时存在困难。提出了一种新的时序分析算法，该算法枚举时延大于给定阈值的所有路径。该算法的执行时间与生成的路径数量成正比，因此适用于大型设计。

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

查看原文本刊更多论文

A path selection algorithm for timing analysis

Existing algorithms for timing analysis have difficulties when dealing with large designs. A novel algorithm for timing analysis is proposed that enumerates all the paths with delay greater than a given threshold. The execution time of the proposed algorithm is proportional to the number of paths generated, so it is suitable for large designs.<>

求助全文

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

来源期刊

25th ACM/IEEE, Design Automation Conference.Proceedings 1988.

自引率

0.00%

发文量