{"id":"https://openalex.org/W1483256448","doi":"https://doi.org/10.1109/iccad.2004.1382623","title":"Efficient statistical timing analysis through error budgeting","display_name":"Efficient statistical timing analysis through error budgeting","publication_year":2005,"publication_date":"2005-02-22","ids":{"openalex":"https://openalex.org/W1483256448","doi":"https://doi.org/10.1109/iccad.2004.1382623","mag":"1483256448"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2004.1382623","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2004.1382623","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055444437","display_name":"Vishal Khandelwal","orcid":"https://orcid.org/0000-0003-4321-8125"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"V. Khandelwal","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, USA","Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072204999","display_name":"Azadeh Davoodi","orcid":"https://orcid.org/0000-0001-5213-2556"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Davoodi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, USA","Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089770783","display_name":"Ankur Srivastava","orcid":"https://orcid.org/0000-0002-5445-904X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Srivastava","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, USA","Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055444437"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":3.6276,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.92299599,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"473","last_page":"477"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6631813049316406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6560628414154053},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.6063687205314636},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.5772382020950317},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5747698545455933},{"id":"https://openalex.org/keywords/piecewise-linear-function","display_name":"Piecewise linear function","score":0.5045350790023804},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48115575313568115},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46723705530166626},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4618228077888489},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.4385480284690857},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2934098243713379}],"concepts":[{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6631813049316406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6560628414154053},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.6063687205314636},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.5772382020950317},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5747698545455933},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.5045350790023804},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48115575313568115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46723705530166626},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4618228077888489},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.4385480284690857},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2934098243713379},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iccad.2004.1382623","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2004.1382623","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.60.3784","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.3784","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.umd.edu/~vishalk/ICCAD04_sta.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W7553988","https://openalex.org/W1511688816","https://openalex.org/W1978543128","https://openalex.org/W1991908651","https://openalex.org/W2062907832","https://openalex.org/W2098213448","https://openalex.org/W2101264278","https://openalex.org/W2120116751","https://openalex.org/W2126564504","https://openalex.org/W2130601386","https://openalex.org/W2142599304","https://openalex.org/W2143901474","https://openalex.org/W2163527337","https://openalex.org/W2755860782","https://openalex.org/W4230035938","https://openalex.org/W4230566481","https://openalex.org/W4236684146","https://openalex.org/W4237955880","https://openalex.org/W4247815215","https://openalex.org/W4253856301","https://openalex.org/W4254506919","https://openalex.org/W6678664461","https://openalex.org/W6744337212"],"related_works":["https://openalex.org/W2133947431","https://openalex.org/W2490196280","https://openalex.org/W3182827720","https://openalex.org/W1596838019","https://openalex.org/W3208509670","https://openalex.org/W2109304297","https://openalex.org/W2100864966","https://openalex.org/W2083709218","https://openalex.org/W4323366562","https://openalex.org/W4399871426"],"abstract_inverted_index":{"We":[0,79,134],"propose":[1,37],"a":[2,13,38,130],"technique":[3],"for":[4],"optimizing":[5],"the":[6,19,24,27,30,49,59,73],"runtime":[7,74],"in":[8,26,48,151],"statistical":[9,76,125],"timing":[10,34,77,126],"analysis.":[11,78],"Given":[12],"global":[14,43],"acceptable":[15],"error":[16,44,53,87],"budget":[17,54],"at":[18,65,118,148],"primary":[20],"output":[21],"which":[22],"signifies":[23],"difference":[25],"area":[28],"of":[29,40,61,75,83],"accurate":[31,124,143],"and":[32,98,102,128],"approximate":[33],"CDFs,":[35],"we":[36],"formulation":[39],"budgeting":[41],"this":[42,85],"across":[45],"all":[46],"nodes":[47],"circuit.":[50],"This":[51,70],"node":[52,67,86],"is":[55,117],"used":[56],"to":[57,140],"simplify":[58],"computation":[60],"arrival":[62],"time":[63],"CDFs":[64],"each":[66],"using":[68],"approximations.":[69],"simplification":[71],"reduces":[72],"investigate":[80],"two":[81],"ways":[82],"exploiting":[84],"budget,":[88],"firstly":[89],"through":[90],"piecewise":[91,138],"linear":[92,145],"approximation":[93,139,146],"(see":[94],"ibid.,":[95],"A.":[96],"Devgan":[97],"C.":[99],"Kashyap,":[100],"2003)":[101],"secondly":[103],"though":[104],"hierarchical":[105],"quadratic":[106,137],"approximation.":[107],"Experimental":[108],"results":[109],"on":[110],"ISCAS/MCNC":[111],"benchmarks":[112],"show":[113],"that":[114],"our":[115],"approach":[116],"most":[119],"3":[120],"times":[121],"faster":[122],"than":[123,144],"analysis":[127],"had":[129],"very":[131],"small":[132],"error.":[133],"also":[135],"found":[136],"be":[141],"more":[142],"but":[147],"lesser":[149],"gains":[150],"runtime.":[152]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}