{"id":"https://openalex.org/W2049542708","doi":"https://doi.org/10.1109/hpcsim.2012.6266972","title":"On the effectiveness of register moves to minimise post-pass unrolling in software pipelined loops","display_name":"On the effectiveness of register moves to minimise post-pass unrolling in software pipelined loops","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2049542708","doi":"https://doi.org/10.1109/hpcsim.2012.6266972","mag":"2049542708"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2012.6266972","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2012.6266972","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5043744080","display_name":"Mounira Bachir","orcid":null},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mounira Bachir","raw_affiliation_strings":["LIP6, Universit\u00e9 Pierre et Marie Curie, Paris, France","Universit\u00e9 Pierre et Marie Curie, LIP6 - Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIP6, Universit\u00e9 Pierre et Marie Curie, Paris, France","institution_ids":["https://openalex.org/I39804081"]},{"raw_affiliation_string":"Universit\u00e9 Pierre et Marie Curie, LIP6 - Paris, France","institution_ids":["https://openalex.org/I39804081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063162788","display_name":"Albert Cohen","orcid":"https://orcid.org/0000-0002-8866-5343"},"institutions":[{"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"]},{"id":"https://openalex.org/I29607241","display_name":"\u00c9cole Normale Sup\u00e9rieure - PSL","ror":"https://ror.org/05a0dhs15","country_code":"FR","type":"other","lineage":["https://openalex.org/I2746051580","https://openalex.org/I29607241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Albert Cohen","raw_affiliation_strings":["INRIA, Ecole Normale Sup\u00e9erieure, Paris, France","Ecole Normale Sup\u00e9rieure - INRIA Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA, Ecole Normale Sup\u00e9erieure, Paris, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Ecole Normale Sup\u00e9rieure - INRIA Paris, France","institution_ids":["https://openalex.org/I29607241"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109050226","display_name":"Sid\u2010Ahmed\u2010Ali Touati","orcid":null},"institutions":[{"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"]},{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sid-Ahmed-Ali Touati","raw_affiliation_strings":["INRIA-Sophia-Antipolis, Nice, France","Inria Sophia-Antipolis, Nice, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA-Sophia-Antipolis, Nice, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I201841394"]},{"raw_affiliation_string":"Inria Sophia-Antipolis, Nice, France#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.11878718,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"39","issue":null,"first_page":"551","last_page":"558"},"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.9998999834060669,"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.9998999834060669,"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.9983000159263611,"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/T10126","display_name":"Logic, programming, and type systems","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/loop-unrolling","display_name":"Loop unrolling","score":0.9424786567687988},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8395061492919922},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7377550601959229},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.5898557305335999},{"id":"https://openalex.org/keywords/register-allocation","display_name":"Register allocation","score":0.585591197013855},{"id":"https://openalex.org/keywords/software-pipelining","display_name":"Software pipelining","score":0.5587319135665894},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.5324804782867432},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5045667886734009},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.41054442524909973},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3238431215286255},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17960190773010254},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.12698590755462646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0824618935585022}],"concepts":[{"id":"https://openalex.org/C76970557","wikidata":"https://www.wikidata.org/wiki/Q1869750","display_name":"Loop unrolling","level":3,"score":0.9424786567687988},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8395061492919922},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7377550601959229},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.5898557305335999},{"id":"https://openalex.org/C128916667","wikidata":"https://www.wikidata.org/wiki/Q1343660","display_name":"Register allocation","level":3,"score":0.585591197013855},{"id":"https://openalex.org/C188854837","wikidata":"https://www.wikidata.org/wiki/Q268469","display_name":"Software pipelining","level":3,"score":0.5587319135665894},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.5324804782867432},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5045667886734009},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.41054442524909973},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3238431215286255},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17960190773010254},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12698590755462646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0824618935585022},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsim.2012.6266972","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2012.6266972","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","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":25,"referenced_works":["https://openalex.org/W277534226","https://openalex.org/W1505765192","https://openalex.org/W1506585561","https://openalex.org/W1551927567","https://openalex.org/W1783018127","https://openalex.org/W1883726693","https://openalex.org/W1963718362","https://openalex.org/W1998629568","https://openalex.org/W2001033342","https://openalex.org/W2012512596","https://openalex.org/W2045503187","https://openalex.org/W2053999332","https://openalex.org/W2074937107","https://openalex.org/W2107283044","https://openalex.org/W2137300667","https://openalex.org/W2155583896","https://openalex.org/W2157758640","https://openalex.org/W3001659479","https://openalex.org/W3143608323","https://openalex.org/W3148529197","https://openalex.org/W4230458386","https://openalex.org/W4238224159","https://openalex.org/W4249499534","https://openalex.org/W4250047106","https://openalex.org/W4253299461"],"related_works":["https://openalex.org/W2152533950","https://openalex.org/W4252395411","https://openalex.org/W1990531366","https://openalex.org/W2372015459","https://openalex.org/W2053999332","https://openalex.org/W4248626492","https://openalex.org/W4240874773","https://openalex.org/W2083264194","https://openalex.org/W2021807611","https://openalex.org/W4239583065"],"abstract_inverted_index":{"Software":[0],"pipelining":[1],"is":[2,29,72,92],"a":[3,37,63,152],"powerful":[4],"technique":[5],"to":[6,87,126,137],"expose":[7],"fine-grain":[8],"parallelism,":[9],"but":[10,100],"it":[11],"results":[12],"in":[13,59,169],"variables":[14],"staying":[15],"alive":[16],"across":[17],"more":[18],"than":[19],"one":[20],"kernel":[21,139],"iteration.":[22],"It":[23],"requires":[24],"periodic":[25],"register":[26,89],"allocation":[27],"and":[28,75,160],"challenging":[30],"for":[31],"code":[32],"generation:":[33],"the":[34,42,55,61,68,95,104,110,121,131,148,156,177],"lack":[35],"of":[36,44,97,112,133,155,176],"reliable":[38],"solution":[39,50],"currently":[40],"restricts":[41],"applicability":[43],"software":[45,49,88,113],"pipelining.":[46,114],"The":[47],"classical":[48],"that":[51],"does":[52],"not":[53],"alter":[54],"computation":[56],"throughput":[57],"consists":[58],"unrolling":[60,70,82,124,167],"loop":[62,81,123,140],"posteriori":[64],"[11],":[65],"[10].":[66],"However,":[67],"resulting":[69],"degree":[71],"often":[73],"unacceptable":[74],"may":[76,102],"reach":[77],"absurd":[78],"levels.":[79],"Alternatively,":[80],"can":[83],"be":[84],"avoided":[85],"thanks":[86],"renaming.":[90],"This":[91,115],"achieved":[93],"through":[94],"insertion":[96],"move":[98,144],"operations,":[99],"this":[101],"increase":[103,175],"initiation":[105],"interval":[106],"(II)":[107],"which":[108],"nullifies":[109],"benefits":[111],"article":[116],"aims":[117],"at":[118],"tightly":[119],"controling":[120],"post-pass":[122],"necessary":[125],"generate":[127],"code.":[128],"We":[129,150],"study":[130],"potential":[132],"live":[134],"range":[135],"splitting":[136],"reduce":[138],"unrolling,":[141],"introducing":[142],"additional":[143],"instructions":[145],"without":[146],"inscreasing":[147],"II.":[149,178],"provide":[151],"complete":[153],"formalisation":[154],"problem,":[157],"an":[158],"algorithm,":[159],"extensive":[161],"experiments.":[162],"Our":[163],"algorithm":[164],"yields":[165],"low":[166],"degrees":[168],"most":[170],"cases":[171],"-":[172],"with":[173],"no":[174]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}