{"id":"https://openalex.org/W1963575401","doi":"https://doi.org/10.1109/isqed.2010.5450492","title":"A revisit to the primal-dual based clock skew scheduling algorithm","display_name":"A revisit to the primal-dual based clock skew scheduling algorithm","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W1963575401","doi":"https://doi.org/10.1109/isqed.2010.5450492","mag":"1963575401"},"language":"en","primary_location":{"id":"doi:10.1109/isqed.2010.5450492","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isqed.2010.5450492","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 11th International Symposium on Quality Electronic Design (ISQED)","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/A5112058834","display_name":"Min Ni","orcid":null},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]},{"id":"https://openalex.org/I4210088951","display_name":"Synopsys (United States)","ror":"https://ror.org/013by2m91","country_code":"US","type":"company","lineage":["https://openalex.org/I4210088951"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Min Ni","raw_affiliation_strings":["Northwestern University, Evanston, IL, USA","Synopsys, Inc., Mountain View, CA, USA"],"affiliations":[{"raw_affiliation_string":"Northwestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]},{"raw_affiliation_string":"Synopsys, Inc., Mountain View, CA, USA","institution_ids":["https://openalex.org/I4210088951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111716641","display_name":"Seda \u00d6\u01e7renci Memik","orcid":null},"institutions":[{"id":"https://openalex.org/I4210088951","display_name":"Synopsys (United States)","ror":"https://ror.org/013by2m91","country_code":"US","type":"company","lineage":["https://openalex.org/I4210088951"]},{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seda Ogrenci Memik","raw_affiliation_strings":["Northwestern University, Evanston, IL, USA","Synopsys, Inc., Mountain View, CA, USA"],"affiliations":[{"raw_affiliation_string":"Northwestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]},{"raw_affiliation_string":"Synopsys, Inc., Mountain View, CA, USA","institution_ids":["https://openalex.org/I4210088951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112058834"],"corresponding_institution_ids":["https://openalex.org/I111979921","https://openalex.org/I4210088951"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.05618194,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"755","last_page":"764"},"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.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computer-science","display_name":"Computer science","score":0.6045170426368713},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5519527792930603},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5507873892784119},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5281270146369934},{"id":"https://openalex.org/keywords/skew","display_name":"Skew","score":0.495077520608902},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4236806333065033},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.41572442650794983},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3976302444934845},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3587643504142761},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2759319543838501}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6045170426368713},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5519527792930603},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5507873892784119},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5281270146369934},{"id":"https://openalex.org/C43711488","wikidata":"https://www.wikidata.org/wiki/Q7534783","display_name":"Skew","level":2,"score":0.495077520608902},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4236806333065033},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.41572442650794983},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3976302444934845},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3587643504142761},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2759319543838501},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isqed.2010.5450492","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isqed.2010.5450492","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 11th International Symposium on Quality Electronic Design (ISQED)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1511469799","https://openalex.org/W1829133288","https://openalex.org/W1875554762","https://openalex.org/W1985882632","https://openalex.org/W1992904457","https://openalex.org/W2002848805","https://openalex.org/W2011778848","https://openalex.org/W2079497321","https://openalex.org/W2125690626","https://openalex.org/W2133193036","https://openalex.org/W2135347849","https://openalex.org/W2150660745","https://openalex.org/W4231706861","https://openalex.org/W4238470610","https://openalex.org/W6638744798"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2149404148","https://openalex.org/W2073248645","https://openalex.org/W3212179065","https://openalex.org/W2184070258","https://openalex.org/W2348923905"],"abstract_inverted_index":{"Clock":[0],"skew":[1,80],"scheduling":[2,81],"is":[3,58,103,128,138,164],"a":[4,26,73,88],"useful":[5],"sequential":[6],"circuit":[7],"optimization":[8,54,95],"method.":[9],"The":[10,30,97,121,157],"run":[11],"time":[12],"efficiency":[13,124],"of":[14,64,100,117,125,129],"this":[15,38,68],"problem":[16,39,82],"becomes":[17],"crucial":[18],"if":[19],"it":[20,47],"must":[21],"be":[22,50,84],"repeated":[23],"iteratively":[24],"in":[25,52,153],"higher":[27],"level":[28],"optimization.":[29,66,120],"widely":[31],"recognized":[32],"Burns'":[33,171],"algorithm":[34,57,90,102,127,163],"proposed":[35,155],"to":[36,49,77,104,147],"solve":[37],"suffers":[40],"from":[41,140],"high":[42],"runtime":[43,123],"complexity,":[44],"which":[45,137],"makes":[46],"unsuitable":[48],"deployed":[51],"iterative":[53],"loops.":[55],"This":[56],"based":[59],"on":[60,165],"the":[61,78,92,101,118,148],"general":[62],"concept":[63],"primal-dual":[65,94,119],"In":[67,173],"paper,":[69],"we":[70,176],"demonstrate":[71],"that":[72,161],"more":[74],"efficient":[75],"approach":[76],"clock":[79],"can":[83,177],"developed":[85],"by":[86],"designing":[87],"new":[89,107],"using":[91],"same":[93],"concept.":[96],"basic":[98],"idea":[99],"avoid":[105],"creating":[106],"admissible":[108],"graph":[109],"and":[110],"recalculating":[111],"\u00bf":[112],"values":[113],"for":[114],"each":[115],"iteration":[116],"asymptotic":[122],"our":[126,154,162],"O(|V||E|":[130],"+":[131],"|V|":[132],"<sup":[133,142],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[134,143],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[135,144],"log|V|),":[136],"improved":[139],"O(|V|":[141],"|E|)":[145],"thanks":[146],"heap":[149],"data":[150],"structure":[151],"used":[152],"algorithm.":[156],"experimental":[158],"results":[159],"show":[160],"average":[166],"95":[167],"times":[168,183],"faster":[169],"than":[170],"implementation.":[172],"best":[174],"case,":[175],"observe":[178],"as":[179,181],"much":[180],"189":[182],"speedup.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}