{"id":"https://openalex.org/W2025155837","doi":"https://doi.org/10.1145/1361096.1361099","title":"Optimal vs. heuristic integrated code generation for clustered VLIW architectures","display_name":"Optimal vs. heuristic integrated code generation for clustered VLIW architectures","publication_year":2008,"publication_date":"2008-03-13","ids":{"openalex":"https://openalex.org/W2025155837","doi":"https://doi.org/10.1145/1361096.1361099","mag":"2025155837"},"language":"en","primary_location":{"id":"doi:10.1145/1361096.1361099","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1361096.1361099","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th international workshop on Software & compilers for embedded systems","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/A5077536351","display_name":"Mattias Eriksson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mattias V. Eriksson","raw_affiliation_strings":["Link\u00f6ping university, Link\u00f6ping, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Link\u00f6ping university, Link\u00f6ping, Sweden","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073050263","display_name":"Oskar Skoog","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oskar Skoog","raw_affiliation_strings":["Link\u00f6ping university, Link\u00f6ping, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Link\u00f6ping university, Link\u00f6ping, Sweden","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059272770","display_name":"Christoph Ke\u00dfler","orcid":"https://orcid.org/0000-0001-5241-0026"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christoph W. Kessler","raw_affiliation_strings":["Link\u00f6ping university, Link\u00f6ping, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Link\u00f6ping university, Link\u00f6ping, Sweden","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3567,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.8127623,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10299","display_name":"Photonic and Optical Devices","score":0.9973999857902527,"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/T10299","display_name":"Photonic and Optical Devices","score":0.9973999857902527,"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/T11429","display_name":"Semiconductor Lasers and Optical Devices","score":0.9959999918937683,"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/T10205","display_name":"Advanced Fiber Optic Sensors","score":0.9751999974250793,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/very-long-instruction-word","display_name":"Very long instruction word","score":0.8742172718048096},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7770432233810425},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7057507634162903},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.697442889213562},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5947383642196655},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5152809619903564},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.5129108428955078},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.49912548065185547},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.48401352763175964},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.4611435532569885},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.45487508177757263},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4520804286003113},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09556841850280762},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09553003311157227}],"concepts":[{"id":"https://openalex.org/C170595534","wikidata":"https://www.wikidata.org/wiki/Q249743","display_name":"Very long instruction word","level":2,"score":0.8742172718048096},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7770432233810425},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7057507634162903},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.697442889213562},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5947383642196655},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5152809619903564},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.5129108428955078},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.49912548065185547},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.48401352763175964},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.4611435532569885},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.45487508177757263},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4520804286003113},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09556841850280762},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09553003311157227},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1361096.1361099","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1361096.1361099","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th international workshop on Software & compilers for embedded systems","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":21,"referenced_works":["https://openalex.org/W122980706","https://openalex.org/W144747564","https://openalex.org/W341155321","https://openalex.org/W1547856753","https://openalex.org/W1566248920","https://openalex.org/W1581686471","https://openalex.org/W1639032689","https://openalex.org/W2010594747","https://openalex.org/W2016088745","https://openalex.org/W2063583051","https://openalex.org/W2093650773","https://openalex.org/W2095798192","https://openalex.org/W2117285153","https://openalex.org/W2118034614","https://openalex.org/W2123412205","https://openalex.org/W2129207930","https://openalex.org/W2130762555","https://openalex.org/W2131889093","https://openalex.org/W2131929304","https://openalex.org/W2137995472","https://openalex.org/W3023540311"],"related_works":["https://openalex.org/W2372381897","https://openalex.org/W1585182585","https://openalex.org/W1974283739","https://openalex.org/W4249931222","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2109912052","https://openalex.org/W1711527768","https://openalex.org/W1566248920","https://openalex.org/W2146636354"],"abstract_inverted_index":{"In":[0,75],"this":[1],"paper":[2],"we":[3],"present":[4],"two":[5,62],"algorithms":[6,37],"for":[7,11,67],"integrated":[8],"code":[9],"generation":[10],"clustered":[12],"VLIW":[13],"architectures.":[14],"One":[15],"algorithm":[16,26,56,79],"is":[17,27,73],"a":[18,41],"heuristic":[19,78],"based":[20,28],"on":[21,29,40],"genetic":[22,55],"algorithms,":[23],"the":[24,36,44,51,54,68,71,77,87],"other":[25],"integer":[30,89],"linear":[31,90],"programming.":[32],"The":[33],"performance":[34],"of":[35,43,53],"are":[38],"compared":[39],"portion":[42],"Mediabench":[45],"[10]":[46],"benchmark":[47],"suite.":[48],"We":[49],"found":[50],"results":[52,81],"to":[57],"be":[58],"within":[59],"one":[60],"or":[61],"clock":[63],"cycles":[64],"from":[65],"optimal":[66,88],"cases":[69],"where":[70],"optimum":[72],"known.":[74],"addition":[76],"produces":[80],"in":[82],"predictable":[83],"time":[84],"also":[85],"when":[86],"program":[91],"fails.":[92]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}