{"id":"https://openalex.org/W1989332035","doi":"https://doi.org/10.1002/cpe.1014","title":"UFS: a global trade\u2010off strategy for loop unrolling for VLIW architectures","display_name":"UFS: a global trade\u2010off strategy for loop unrolling for VLIW architectures","publication_year":2006,"publication_date":"2006-01-12","ids":{"openalex":"https://openalex.org/W1989332035","doi":"https://doi.org/10.1002/cpe.1014","mag":"1989332035"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.1014","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.1014","pdf_url":null,"source":{"id":"https://openalex.org/S11065456","display_name":"Concurrency and Computation Practice and Experience","issn_l":"1532-0626","issn":["1532-0626","1532-0634"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency and Computation: Practice and Experience","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/A5034064440","display_name":"Karine Heydemann","orcid":"https://orcid.org/0000-0003-2092-924X"},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"K. Heydemann","raw_affiliation_strings":["INRIA/IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France","INRIA/IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France#TAB#"],"affiliations":[{"raw_affiliation_string":"INRIA/IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I2802519937"]},{"raw_affiliation_string":"INRIA/IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5105936201","display_name":"Fran\u00e7ois Bodin","orcid":null},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"F. Bodin","raw_affiliation_strings":["INRIA/IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France","INRIA/IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France#TAB#"],"affiliations":[{"raw_affiliation_string":"INRIA/IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I2802519937"]},{"raw_affiliation_string":"INRIA/IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082021159","display_name":"P. M. W. Knijnenburg","orcid":null},"institutions":[{"id":"https://openalex.org/I121797337","display_name":"Leiden University","ror":"https://ror.org/027bh9e22","country_code":"NL","type":"education","lineage":["https://openalex.org/I121797337"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"P. M. W. Knijnenburg","raw_affiliation_strings":["LIACS, Leiden University, Leiden, The Netherlands","[LIACS, Leiden University Leiden, The Netherlands]"],"affiliations":[{"raw_affiliation_string":"LIACS, Leiden University, Leiden, The Netherlands","institution_ids":["https://openalex.org/I121797337"]},{"raw_affiliation_string":"[LIACS, Leiden University Leiden, The Netherlands]","institution_ids":["https://openalex.org/I121797337"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000331460","display_name":"Luce Morin","orcid":"https://orcid.org/0000-0001-8241-1425"},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"L. Morin","raw_affiliation_strings":["INRIA/IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France","INRIA/IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France#TAB#"],"affiliations":[{"raw_affiliation_string":"INRIA/IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I2802519937"]},{"raw_affiliation_string":"INRIA/IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5034064440"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I2802519937"],"apc_list":{"value":4740,"currency":"USD","value_usd":4740},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.08329893,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"18","issue":"11","first_page":"1413","last_page":"1434"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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":1.0,"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.9976999759674072,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9929999709129333,"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/computer-science","display_name":"Computer science","score":0.9099186658859253},{"id":"https://openalex.org/keywords/loop-unrolling","display_name":"Loop unrolling","score":0.8495397567749023},{"id":"https://openalex.org/keywords/very-long-instruction-word","display_name":"Very long instruction word","score":0.7629671096801758},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6454261541366577},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6103137731552124},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.46630942821502686},{"id":"https://openalex.org/keywords/program-optimization","display_name":"Program optimization","score":0.45530858635902405},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2286689579486847},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.15889772772789001},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1425493359565735}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9099186658859253},{"id":"https://openalex.org/C76970557","wikidata":"https://www.wikidata.org/wiki/Q1869750","display_name":"Loop unrolling","level":3,"score":0.8495397567749023},{"id":"https://openalex.org/C170595534","wikidata":"https://www.wikidata.org/wiki/Q249743","display_name":"Very long instruction word","level":2,"score":0.7629671096801758},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6454261541366577},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6103137731552124},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.46630942821502686},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.45530858635902405},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2286689579486847},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.15889772772789001},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1425493359565735},{"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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1002/cpe.1014","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.1014","pdf_url":null,"source":{"id":"https://openalex.org/S11065456","display_name":"Concurrency and Computation Practice and Experience","issn_l":"1532-0626","issn":["1532-0626","1532-0634"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency and Computation: Practice and Experience","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/b0f119d0-7665-4f78-86ce-a4e3d880953d","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/ufs-a-global-tradeoff-strategy-for-loop-unrolling-for-vliw-architectures(b0f119d0-7665-4f78-86ce-a4e3d880953d).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Heydeman, K, Bodin, F, Knijnenburg, P M W & Morin, L 2006, 'UFS: a Global Trade-off Strategy for Loop Unrolling for VLIW Architectures', Concurrency and Computation: Practice and Experience, vol. 18, no. 11, pp. 1413-1434. https://doi.org/10.1002/cpe.1014","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:HAL:hal-01195877v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01195877","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Concurrency and Computation: Practice and Experience, 2006, 18 (11), pp.1413-1434. ⟨10.1002/cpe.1014⟩","raw_type":"Journal articles"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/b0f119d0-7665-4f78-86ce-a4e3d880953d","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/ufs-a-global-tradeoff-strategy-for-loop-unrolling-for-vliw-architectures(b0f119d0-7665-4f78-86ce-a4e3d880953d).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Concurrency and Computation: Practice and Experience, 18(11), 1413 - 1434. John Wiley and Sons Ltd","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W627820380","https://openalex.org/W1479761671","https://openalex.org/W1531339993","https://openalex.org/W1584183132","https://openalex.org/W1686420892","https://openalex.org/W1997649574","https://openalex.org/W2009749048","https://openalex.org/W2032250313","https://openalex.org/W2058614217","https://openalex.org/W2063255488","https://openalex.org/W2066670963","https://openalex.org/W2098891450","https://openalex.org/W2117790850","https://openalex.org/W2118533903","https://openalex.org/W2119691711","https://openalex.org/W2122418911","https://openalex.org/W2126258136","https://openalex.org/W2136176456","https://openalex.org/W2150871235","https://openalex.org/W2154847378","https://openalex.org/W2171072418","https://openalex.org/W2561675875","https://openalex.org/W2609112314","https://openalex.org/W2728232616","https://openalex.org/W4232588022","https://openalex.org/W4238566657","https://openalex.org/W4242985528","https://openalex.org/W4247412660","https://openalex.org/W4250700635","https://openalex.org/W4251331796","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W1899165969","https://openalex.org/W2155583896","https://openalex.org/W4230458386","https://openalex.org/W2058188174","https://openalex.org/W4248667787","https://openalex.org/W1563688358","https://openalex.org/W1769051252","https://openalex.org/W2379796161","https://openalex.org/W22679064","https://openalex.org/W2164503864"],"abstract_inverted_index":{"Abstract":[0],"Embedded":[1],"systems":[2],"are":[3,68,81],"increasingly":[4],"expected":[5],"to":[6,70],"provide":[7],"good":[8,73],"performance":[9,79],"at":[10],"low":[11],"cost.":[12],"As":[13,44],"the":[14,24,114,129],"characteristics":[15],"of":[16,27,103,113,120],"compiled":[17],"code":[18,54,61,76,109,123],"can":[19],"have":[20],"an":[21,28,57],"impact":[22],"on":[23,92,128],"overall":[25],"cost":[26,36,50],"embedded":[29],"system,":[30],"a":[31,72,88,118],"compilation":[32],"strategy":[33],"must":[34],"be":[35],"aware":[37],"as":[38,40],"well":[39],"achieve":[41],"high":[42],"performance.":[43,126],"one":[45],"major":[46],"factor":[47],"for":[48,96,101],"system":[49],"is":[51],"memory":[52],"size,":[53],"size":[55,77,110,124],"becomes":[56],"important":[58],"issue":[59],"in":[60],"generation.":[62],"Thus,":[63],"cost\u2010effective":[64],"optimization":[65],"strategies":[66],"that":[67,133],"able":[69],"perform":[71],"trade\u2010off":[74,121],"between":[75,122],"and":[78,111,125],"improvement":[80],"needed.":[82],"In":[83],"this":[84],"paper,":[85],"we":[86],"propose":[87],"novel":[89],"method":[90,135],"based":[91],"Integer":[93],"Linear":[94],"Programming":[95],"computing":[97],"efficient":[98],"unroll":[99],"factors":[100],"collections":[102],"loop":[104],"nests":[105],"with":[106],"control":[107],"over":[108],"side\u2010effects":[112],"transformation.":[115],"We":[116],"define":[117],"notion":[119],"Experiments":[127],"Philips":[130],"Trimedia":[131],"show":[132],"our":[134],"achieves":[136],"excellent":[137],"trade\u2010offs.":[138],"Copyright":[139],"\u00a9":[140],"2006":[141],"John":[142],"Wiley":[143],"&":[144],"Sons,":[145],"Ltd.":[146]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2025-10-10T00:00:00"}