{"title":"ECO Timing Optimization with Data Paths and Clock Paths Considered","authors":"Jia-Xiang Tang, Shih-Hsu Huang, Jui-Hung Hung","doi":"10.1109/ISPACS51563.2021.9650994","DOIUrl":null,"url":null,"abstract":"Metal-only ECO (engineering change order) is an important process for timing optimization after the layout has been completed. To fix timing violations, previous works use spare cells to revise data paths. Different from previous works, in this paper, we propose a new approach to fix timing violations by considering both data paths and clock paths. The proposed algorithm creates a candidate list (from both data paths and clock paths) based on current timing conditions and spare cell data, and then it calculates the costs to select the best revision method. The algorithm repeats until no further improvement can be made. Experiment results show that the proposed approach can achieve better timing results than previous works.","PeriodicalId":359822,"journal":{"name":"2021 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPACS51563.2021.9650994","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Metal-only ECO (engineering change order) is an important process for timing optimization after the layout has been completed. To fix timing violations, previous works use spare cells to revise data paths. Different from previous works, in this paper, we propose a new approach to fix timing violations by considering both data paths and clock paths. The proposed algorithm creates a candidate list (from both data paths and clock paths) based on current timing conditions and spare cell data, and then it calculates the costs to select the best revision method. The algorithm repeats until no further improvement can be made. Experiment results show that the proposed approach can achieve better timing results than previous works.