{"id":"https://openalex.org/W4248769596","doi":"https://doi.org/10.1109/aspdac.2018.8297301","title":"FastPass: Fast timing path search for generalized timing exception handling","display_name":"FastPass: Fast timing path search for generalized timing exception handling","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W4248769596","doi":"https://doi.org/10.1109/aspdac.2018.8297301"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2018.8297301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2018.8297301","pdf_url":null,"source":{"id":"https://openalex.org/S4363608266","display_name":"2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)","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/A5067320974","display_name":"Pei\u2010Yu Lee","orcid":"https://orcid.org/0000-0002-2551-6615"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Pei-Yu Lee","raw_affiliation_strings":["Department of Electronics Engineering, National Chiao Tung University, Hsinchu, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Electronics Engineering, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031004106","display_name":"Iris Hui-Ru Jiang","orcid":"https://orcid.org/0000-0002-4554-3442"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]},{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Iris Hui-Ru Jiang","raw_affiliation_strings":["Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan","Department of Electronics Engineering, National Chiao Tung University, Hsinchu, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]},{"raw_affiliation_string":"Department of Electronics Engineering, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033920886","display_name":"Tung-Chieh Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tung-Chieh Chen","raw_affiliation_strings":["Maxeda Technology, Hsinchu, Taiwan"],"affiliations":[{"raw_affiliation_string":"Maxeda Technology, Hsinchu, Taiwan","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067320974"],"corresponding_institution_ids":["https://openalex.org/I148366613"],"apc_list":null,"apc_paid":null,"fwci":3.0402,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.9204244,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"172","last_page":"177"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"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/T10472","display_name":"Semiconductor materials and devices","score":0.9983000159263611,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/static-timing-analysis","display_name":"Static timing analysis","score":0.8794258832931519},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7339873313903809},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7150170803070068},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7142225503921509},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.520410418510437},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.48054105043411255},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33866602182388306},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17778411507606506},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.16346707940101624},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.10841816663742065}],"concepts":[{"id":"https://openalex.org/C93682380","wikidata":"https://www.wikidata.org/wiki/Q2025226","display_name":"Static timing analysis","level":2,"score":0.8794258832931519},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7339873313903809},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7150170803070068},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7142225503921509},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.520410418510437},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.48054105043411255},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33866602182388306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17778411507606506},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.16346707940101624},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.10841816663742065},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aspdac.2018.8297301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2018.8297301","pdf_url":null,"source":{"id":"https://openalex.org/S4363608266","display_name":"2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W658677875","https://openalex.org/W1983141247","https://openalex.org/W2016233710","https://openalex.org/W2096022242","https://openalex.org/W2137874877","https://openalex.org/W4232044093","https://openalex.org/W4237185564","https://openalex.org/W4238050405","https://openalex.org/W4252769808","https://openalex.org/W6682306282"],"related_works":["https://openalex.org/W2116465486","https://openalex.org/W830396839","https://openalex.org/W3196508834","https://openalex.org/W2490317825","https://openalex.org/W2171940562","https://openalex.org/W2101572961","https://openalex.org/W2154884030","https://openalex.org/W2544991366","https://openalex.org/W4293070556","https://openalex.org/W2354030579"],"abstract_inverted_index":{"As":[0],"design":[1,7,23],"complexity":[2],"rapidly":[3],"grows,":[4],"a":[5,22,95],"modem":[6],"contains":[8],"more":[9,14],"complex":[10],"constraints":[11],"and":[12,87,128,140,148],"has":[13],"clock":[15],"domains.":[16],"To":[17],"these":[18,65],"stringent":[19],"timing":[20,32,38,50,79,85,90,97,107],"requirements,":[21],"is":[24,40,138,143],"iteratively":[25],"optimized.":[26],"Along":[27],"with":[28,145],"intensive":[29],"optimizations,":[30],"fast":[31,102,118],"analysis":[33,98],"guiding":[34],"designers":[35],"to":[36,81,116],"fix":[37],"violations":[39],"desired.":[41],"Thus":[42],"far,":[43],"previous":[44],"works":[45],"have":[46],"focused":[47],"on":[48],"either":[49],"exception":[51,108],"handling":[52],"or":[53],"path":[54,103,119],"search":[55,104],"only.":[56],"Different":[57],"from":[58],"them,":[59],"in":[60,73],"this":[61],"paper,":[62],"we":[63,93,111],"tackle":[64],"two":[66],"issues":[67],"together":[68],"for":[69,105],"the":[70],"urgent":[71],"need":[72],"modern":[74],"design.":[75],"We":[76],"first":[77],"generalize":[78],"exceptions":[80,86],"model":[82,137],"all":[83],"common":[84],"other":[88],"path-specific":[89],"quantities.":[91],"Then,":[92],"propose":[94],"novel":[96],"flow":[99,142],"that":[100,135],"performs":[101],"generalized":[106],"handling.":[109],"Furthermore,":[110],"develop":[112],"three":[113],"delicate":[114],"techniques":[115],"achieve":[117],"search,":[120],"including":[121],"local":[122],"slack":[123,126,129],"bounds,":[124],"dynamic":[125],"recovering,":[127],"priority":[130],"queue.":[131],"Experimental":[132],"results":[133],"show":[134],"our":[136,141],"general,":[139],"promising":[144],"high":[146],"efficiency":[147],"scalability.":[149]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}