{"id":"https://openalex.org/W2160450201","doi":"https://doi.org/10.1109/tvlsi.2008.2001863","title":"Recurrence-Aware Instruction Set Selection for Extensible Embedded Processors","display_name":"Recurrence-Aware Instruction Set Selection for Extensible Embedded Processors","publication_year":2008,"publication_date":"2008-09-24","ids":{"openalex":"https://openalex.org/W2160450201","doi":"https://doi.org/10.1109/tvlsi.2008.2001863","mag":"2160450201"},"language":"en","primary_location":{"id":"doi:10.1109/tvlsi.2008.2001863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2008.2001863","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","raw_type":"journal-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/A5022989275","display_name":"Paolo Bonzini","orcid":null},"institutions":[{"id":"https://openalex.org/I57201433","display_name":"Universit\u00e0 della Svizzera italiana","ror":"https://ror.org/03c4atk17","country_code":"CH","type":"education","lineage":["https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"P. Bonzini","raw_affiliation_strings":["Faculty of Informatics, University of Lugano, Lugano, Switzerland","Fac. of Inf., Univ. of Lugano, Lugano"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, University of Lugano, Lugano, Switzerland","institution_ids":["https://openalex.org/I57201433"]},{"raw_affiliation_string":"Fac. of Inf., Univ. of Lugano, Lugano","institution_ids":["https://openalex.org/I57201433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001362973","display_name":"Laura Pozzi","orcid":"https://orcid.org/0000-0003-1083-8782"},"institutions":[{"id":"https://openalex.org/I57201433","display_name":"Universit\u00e0 della Svizzera italiana","ror":"https://ror.org/03c4atk17","country_code":"CH","type":"education","lineage":["https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"L. Pozzi","raw_affiliation_strings":["Faculty of Informatics, University of Lugano, Lugano, Switzerland","Fac. of Inf., Univ. of Lugano, Lugano"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, University of Lugano, Lugano, Switzerland","institution_ids":["https://openalex.org/I57201433"]},{"raw_affiliation_string":"Fac. of Inf., Univ. of Lugano, Lugano","institution_ids":["https://openalex.org/I57201433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022989275"],"corresponding_institution_ids":["https://openalex.org/I57201433"],"apc_list":null,"apc_paid":null,"fwci":5.3157,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.95896888,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"16","issue":"10","first_page":"1259","last_page":"1267"},"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.9976000189781189,"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.9976000189781189,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9965999722480774,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.7639267444610596},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6707063913345337},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.6086013317108154},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5476537942886353},{"id":"https://openalex.org/keywords/instruction-set","display_name":"Instruction set","score":0.5302376747131348},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5047544240951538},{"id":"https://openalex.org/keywords/conjunction","display_name":"Conjunction (astronomy)","score":0.49418047070503235},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4804917573928833},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47772690653800964},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.441739559173584},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.42949527502059937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38959577679634094},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3658320903778076},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2620279788970947},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19752079248428345},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13097140192985535}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7639267444610596},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6707063913345337},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.6086013317108154},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5476537942886353},{"id":"https://openalex.org/C202491316","wikidata":"https://www.wikidata.org/wiki/Q272683","display_name":"Instruction set","level":2,"score":0.5302376747131348},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5047544240951538},{"id":"https://openalex.org/C59656382","wikidata":"https://www.wikidata.org/wiki/Q191536","display_name":"Conjunction (astronomy)","level":2,"score":0.49418047070503235},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4804917573928833},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47772690653800964},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.441739559173584},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.42949527502059937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38959577679634094},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3658320903778076},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2620279788970947},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19752079248428345},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13097140192985535},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tvlsi.2008.2001863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2008.2001863","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1686420892","https://openalex.org/W1972996117","https://openalex.org/W1975335740","https://openalex.org/W2022341273","https://openalex.org/W2034841960","https://openalex.org/W2039538849","https://openalex.org/W2098051725","https://openalex.org/W2099731629","https://openalex.org/W2103742333","https://openalex.org/W2110350195","https://openalex.org/W2111488604","https://openalex.org/W2120142281","https://openalex.org/W2121156724","https://openalex.org/W2122553095","https://openalex.org/W2128293069","https://openalex.org/W2132660104","https://openalex.org/W2136285318","https://openalex.org/W2137172308","https://openalex.org/W2147405597","https://openalex.org/W2164826555","https://openalex.org/W2165892109","https://openalex.org/W2169406908","https://openalex.org/W3151170728","https://openalex.org/W4229745793","https://openalex.org/W4235274905","https://openalex.org/W4254910020","https://openalex.org/W6637151178","https://openalex.org/W6676285361"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1573992054"],"abstract_inverted_index":{"Automatic":[0],"generation":[1],"of":[2,28,34,109,126,143,171],"a":[3,14,107,124,163,177],"customized":[4],"instruction":[5,52,75],"set,":[6],"starting":[7],"from":[8],"an":[9,74,80,148,157],"input":[10],"application":[11],"code,":[12],"is":[13],"complex":[15,73],"problem":[16,36,96,137],"that":[17,55,63,83,104,152],"has":[18,90],"received":[19],"considerable":[20],"attention":[21],"in":[22,71,138,160],"the":[23,35,95,135,141,168],"past":[24],"few":[25],"years.":[26],"Because":[27],"its":[29],"complexity,":[30],"only":[31],"simplified":[32],"versions":[33],"have":[37,47],"been":[38,48,91],"solved":[39],"exactly":[40],"so":[41],"far.":[42],"For":[43],"example,":[44],"exact":[45,81,130],"algorithms":[46],"proposed":[49],"for":[50],"custom":[51,114],"identification":[53,86],"but":[54,68],"do":[56],"not":[57],"consider":[58],"recurrence;":[59],"other":[60],"methods":[61],"exist":[62],"can":[64,77,84],"indeed":[65],"handle":[66,85],"recurrence,":[67],"are":[69],"limited":[70],"how":[72],"they":[76],"identify.":[78],"However,":[79],"solution":[82],"and":[87,100,111,119,131,175],"recurrence":[88,142],"simultaneously":[89],"missing.":[92],"We":[93,121,146],"divide":[94],"into":[97],"several":[98],"parts":[99],"concentrate":[101],"on":[102],"covering,":[103],"is,":[105],"selecting":[106],"set":[108],"nonoverlapping":[110],"possibly":[112],"recurrent":[113],"instructions":[115],"to":[116,133,155,166],"be":[117],"implemented":[118],"used.":[120],"then":[122],"propose":[123,147],"range":[125],"novel":[127],"algorithms,":[128],"both":[129],"approximate,":[132],"solve":[134],"covering":[136],"conjunction":[139,161],"with":[140,162],"candidate":[144],"extensions.":[145],"optimal":[149],"search":[150,165],"technique":[151],"uses":[153],"branch-and-bound":[154],"improve":[156],"existing":[158],"solution,":[159],"greedy":[164],"help":[167],"algorithm":[169],"out":[170],"any":[172],"local":[173],"optima,":[174],"achieve":[176],"tangible":[178],"improvement":[179],"over":[180],"nonrecurrence-aware":[181],"covering.":[182]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}