{"id":"https://openalex.org/W4240633153","doi":"https://doi.org/10.1109/iccad.2008.4681547","title":"Synthesis from multi-cycle atomic actions as a solution to the timing closure problem","display_name":"Synthesis from multi-cycle atomic actions as a solution to the timing closure problem","publication_year":2008,"publication_date":"2008-11-01","ids":{"openalex":"https://openalex.org/W4240633153","doi":"https://doi.org/10.1109/iccad.2008.4681547"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2008.4681547","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2008.4681547","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE/ACM International Conference on Computer-Aided Design","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/A5026006891","display_name":"Michal Karczmarek","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michal Karczmarek","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060692552","display_name":"Arvind Arvind","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arvind","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026006891"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.3466,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.7354316,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"26","issue":null,"first_page":"24","last_page":"31"},"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.9997000098228455,"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.9997000098228455,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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.781261682510376},{"id":"https://openalex.org/keywords/verilog","display_name":"Verilog","score":0.7656676173210144},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6724948883056641},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6540545225143433},{"id":"https://openalex.org/keywords/combinational-logic","display_name":"Combinational logic","score":0.522896945476532},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.43132779002189636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4090384542942047},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.29026228189468384},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.27869755029678345},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1990591287612915},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.15580976009368896}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.781261682510376},{"id":"https://openalex.org/C2779030575","wikidata":"https://www.wikidata.org/wiki/Q827773","display_name":"Verilog","level":3,"score":0.7656676173210144},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6724948883056641},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6540545225143433},{"id":"https://openalex.org/C81409106","wikidata":"https://www.wikidata.org/wiki/Q76505","display_name":"Combinational logic","level":3,"score":0.522896945476532},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43132779002189636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4090384542942047},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.29026228189468384},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.27869755029678345},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1990591287612915},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.15580976009368896}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2008.4681547","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2008.4681547","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE/ACM International Conference on Computer-Aided Design","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2092911542","https://openalex.org/W2105055683","https://openalex.org/W2148593819","https://openalex.org/W2208481289","https://openalex.org/W3145483441","https://openalex.org/W3149658335","https://openalex.org/W3210523556","https://openalex.org/W4244583165","https://openalex.org/W4250169475","https://openalex.org/W6602164496","https://openalex.org/W6802779965"],"related_works":["https://openalex.org/W1667647204","https://openalex.org/W2404647514","https://openalex.org/W4247536566","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W4241418540","https://openalex.org/W4252501555","https://openalex.org/W2003848320","https://openalex.org/W2121946867","https://openalex.org/W3210240295"],"abstract_inverted_index":{"One":[0],"solution":[1,21,46],"to":[2,8,48,76,99,121,194,203],"the":[3,20,38,62,65,74,104,107,112,116,134,147,150,165,178,182],"timing":[4,44],"closure":[5,45],"problem":[6],"is":[7,24,80,201],"perform":[9],"infrequent":[10],"operations":[11],"in":[12,32,35,138],"more":[13],"than":[14],"one":[15,96],"cycle.":[16],"Despite":[17],"simplicity":[18],"of":[19,52,67,115,149,184],"statement,":[22],"it":[23,29],"not":[25,81],"easily":[26],"considered":[27],"because":[28],"requires":[30],"changes":[31],"RTL,":[33],"which,":[34],"turn,":[36],"exacerbates":[37],"verification":[39],"problem.":[40],"We":[41,60,125,153],"offer":[42],"a":[43,127,131,139],"guaranteed":[47],"preserve":[49],"functional":[50],"correctness":[51],"designs":[53],"expressed":[54],"using":[55],"atomic":[56,68,89],"actions":[57,69,90],"or":[58],"rules.":[59],"exploit":[61],"fact":[63],"that":[64,72,92,177],"semantics":[66,148],"are":[70],"untimed,":[71],"is,":[73],"time":[75],"execute":[77],"an":[78,160],"action":[79],"specified.":[82],"The":[83,174],"current":[84],"hardware":[85],"synthesis":[86,128],"technique":[87,200],"from":[88],"assumes":[91],"each":[93],"rule":[94,105,140],"takes":[95],"clock":[97,113,179,208],"cycle":[98,114],"complete":[100,195],"its":[101],"computation.":[102],"Consequently,":[103],"with":[106],"longest":[108],"combinational":[109,135],"path":[110],"determines":[111],"entire":[117],"design,":[118],"often":[119],"leading":[120],"needlessly":[122],"slow":[123,192],"circuits.":[124],"present":[126,155],"procedure":[129],"for":[130],"system":[132],"where":[133],"circuits":[136,185],"embodied":[137],"can":[141,186],"take":[142],"multiple":[143,197,207],"cycles":[144],"without":[145],"changing":[146],"original":[151],"design.":[152],"also":[154],"preliminary":[156],"results":[157,175],"based":[158,205],"on":[159,206],"experimental":[161],"compiler":[162,168],"which":[163],"uses":[164],"Bluespec":[166],"(BSV)":[167],"front":[169],"end":[170],"and":[171,181],"generates":[172],"Verilog.":[173],"show":[176],"speed":[180],"performance":[183],"be":[187],"improved":[188],"substantially":[189],"by":[190],"allowing":[191],"paths":[193],"over":[196],"cycles.":[198],"Our":[199],"orthogonal":[202],"solutions":[204],"domains.":[209]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}