{"title":"多角多模式场景下的快速缓冲时钟树合成","authors":"Deokkeun Oh, Juho Kim","doi":"10.23919/ELINFOCOM.2018.8330583","DOIUrl":null,"url":null,"abstract":"As CMOS technology continuously scales down, robust clock tree synthesis (CTS) has become increasingly critical in high-performance synchronous chip design. Recently, the process variation during manufacturing affects the performance of the circuit design. In this paper, we proposed fast buffered clock tree synthesis (FBCTS) in multi-corner multi-mode (MCMM) scenario. The ISPD '09 benchmark is used to verify the proposed method. The experiment results show our method reduce about 59% of computation time compared to existing method.","PeriodicalId":413646,"journal":{"name":"2018 International Conference on Electronics, Information, and Communication (ICEIC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast buffered clock tree synthesis in multi corner multi mode scenario\",\"authors\":\"Deokkeun Oh, Juho Kim\",\"doi\":\"10.23919/ELINFOCOM.2018.8330583\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As CMOS technology continuously scales down, robust clock tree synthesis (CTS) has become increasingly critical in high-performance synchronous chip design. Recently, the process variation during manufacturing affects the performance of the circuit design. In this paper, we proposed fast buffered clock tree synthesis (FBCTS) in multi-corner multi-mode (MCMM) scenario. The ISPD '09 benchmark is used to verify the proposed method. The experiment results show our method reduce about 59% of computation time compared to existing method.\",\"PeriodicalId\":413646,\"journal\":{\"name\":\"2018 International Conference on Electronics, Information, and Communication (ICEIC)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Electronics, Information, and Communication (ICEIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/ELINFOCOM.2018.8330583\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Electronics, Information, and Communication (ICEIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ELINFOCOM.2018.8330583","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast buffered clock tree synthesis in multi corner multi mode scenario
As CMOS technology continuously scales down, robust clock tree synthesis (CTS) has become increasingly critical in high-performance synchronous chip design. Recently, the process variation during manufacturing affects the performance of the circuit design. In this paper, we proposed fast buffered clock tree synthesis (FBCTS) in multi-corner multi-mode (MCMM) scenario. The ISPD '09 benchmark is used to verify the proposed method. The experiment results show our method reduce about 59% of computation time compared to existing method.