{"id":"https://openalex.org/W2045503187","doi":"https://doi.org/10.1142/s012962640400188x","title":"Early Periodic Register Allocation on ILP Processors","display_name":"Early Periodic Register Allocation on ILP Processors","publication_year":2004,"publication_date":"2004-06-01","ids":{"openalex":"https://openalex.org/W2045503187","doi":"https://doi.org/10.1142/s012962640400188x","mag":"2045503187"},"language":"en","primary_location":{"id":"doi:10.1142/s012962640400188x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962640400188x","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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/A5109050226","display_name":"Sid\u2010Ahmed\u2010Ali Touati","orcid":null},"institutions":[{"id":"https://openalex.org/I4210165330","display_name":"Institut Lavoisier de Versailles","ror":"https://ror.org/05mzd8v39","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I195731000","https://openalex.org/I277688954","https://openalex.org/I4210128300","https://openalex.org/I4210165330"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sid-Ahmed-Ali TOUATI","raw_affiliation_strings":["PRiSM, University of Versailles, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PRiSM, University of Versailles, France","institution_ids":["https://openalex.org/I4210165330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105937751","display_name":"Christine Eisenbeis","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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christine EISENBEIS","raw_affiliation_strings":["INRIA-Futurs, Orsay Parc Club, France","Architectures, Languages and Compilers to Harness the End of Moore Years"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA-Futurs, Orsay Parc Club, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Architectures, Languages and Compilers to Harness the End of Moore Years","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.53,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.65608207,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":"02","first_page":"287","last_page":"313"},"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.9984999895095825,"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.9973000288009644,"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/register-allocation","display_name":"Register allocation","score":0.9747075438499451},{"id":"https://openalex.org/keywords/software-pipelining","display_name":"Software pipelining","score":0.8314402103424072},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7865619659423828},{"id":"https://openalex.org/keywords/instruction-scheduling","display_name":"Instruction scheduling","score":0.756280779838562},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.736974835395813},{"id":"https://openalex.org/keywords/very-long-instruction-word","display_name":"Very long instruction word","score":0.6415300369262695},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5434136986732483},{"id":"https://openalex.org/keywords/register-file","display_name":"Register file","score":0.5429352521896362},{"id":"https://openalex.org/keywords/instruction-level-parallelism","display_name":"Instruction-level parallelism","score":0.5118650794029236},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.49186229705810547},{"id":"https://openalex.org/keywords/register","display_name":"Register (sociolinguistics)","score":0.4889334738254547},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.47004976868629456},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.44653454422950745},{"id":"https://openalex.org/keywords/allocator","display_name":"Allocator","score":0.4262196719646454},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.3866388201713562},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37786009907722473},{"id":"https://openalex.org/keywords/instruction-set","display_name":"Instruction set","score":0.3665514588356018},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.2824704051017761},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1752522885799408},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15052103996276855},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1362082064151764},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.1253698170185089},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.10598865151405334}],"concepts":[{"id":"https://openalex.org/C128916667","wikidata":"https://www.wikidata.org/wiki/Q1343660","display_name":"Register allocation","level":3,"score":0.9747075438499451},{"id":"https://openalex.org/C188854837","wikidata":"https://www.wikidata.org/wiki/Q268469","display_name":"Software pipelining","level":3,"score":0.8314402103424072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7865619659423828},{"id":"https://openalex.org/C73564150","wikidata":"https://www.wikidata.org/wiki/Q11417093","display_name":"Instruction scheduling","level":5,"score":0.756280779838562},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.736974835395813},{"id":"https://openalex.org/C170595534","wikidata":"https://www.wikidata.org/wiki/Q249743","display_name":"Very long instruction word","level":2,"score":0.6415300369262695},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5434136986732483},{"id":"https://openalex.org/C117280010","wikidata":"https://www.wikidata.org/wiki/Q180944","display_name":"Register file","level":3,"score":0.5429352521896362},{"id":"https://openalex.org/C140763907","wikidata":"https://www.wikidata.org/wiki/Q2714055","display_name":"Instruction-level parallelism","level":3,"score":0.5118650794029236},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.49186229705810547},{"id":"https://openalex.org/C2779235478","wikidata":"https://www.wikidata.org/wiki/Q286576","display_name":"Register (sociolinguistics)","level":2,"score":0.4889334738254547},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47004976868629456},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.44653454422950745},{"id":"https://openalex.org/C162262903","wikidata":"https://www.wikidata.org/wiki/Q343527","display_name":"Allocator","level":2,"score":0.4262196719646454},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.3866388201713562},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37786009907722473},{"id":"https://openalex.org/C202491316","wikidata":"https://www.wikidata.org/wiki/Q272683","display_name":"Instruction set","level":2,"score":0.3665514588356018},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.2824704051017761},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1752522885799408},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15052103996276855},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1362082064151764},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.1253698170185089},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.10598865151405334},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012962640400188x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962640400188x","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W5670727","https://openalex.org/W33157556","https://openalex.org/W1489604929","https://openalex.org/W1504077686","https://openalex.org/W1505765192","https://openalex.org/W1512353928","https://openalex.org/W1523901979","https://openalex.org/W1535182551","https://openalex.org/W1537413611","https://openalex.org/W1564250817","https://openalex.org/W1585371887","https://openalex.org/W1963547452","https://openalex.org/W1963718362","https://openalex.org/W2010751129","https://openalex.org/W2012512596","https://openalex.org/W2050285203","https://openalex.org/W2051214358","https://openalex.org/W2053381804","https://openalex.org/W2087656024","https://openalex.org/W2119773132","https://openalex.org/W2137332808","https://openalex.org/W2139802090","https://openalex.org/W2146405378","https://openalex.org/W2155583896","https://openalex.org/W2167233984","https://openalex.org/W2752885492","https://openalex.org/W2991482330","https://openalex.org/W3195188380","https://openalex.org/W4233923847","https://openalex.org/W4248487161","https://openalex.org/W4249499534","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W4253173659","https://openalex.org/W2168354894","https://openalex.org/W4231369653","https://openalex.org/W18945967","https://openalex.org/W4252189340","https://openalex.org/W2104533913","https://openalex.org/W182448324","https://openalex.org/W2078229301","https://openalex.org/W1513460372","https://openalex.org/W5670727"],"abstract_inverted_index":{"Register":[0],"allocation":[1,21,155],"in":[2,114],"loops":[3],"is":[4,15,74,124,150,156],"generally":[5],"performed":[6],"after":[7],"or":[8,162],"during":[9],"the":[10,31,40,54,67,90,103,108,127,137,147,178],"software":[11,71],"pipelining":[12],"process.":[13],"This":[14],"because":[16],"doing":[17],"a":[18,23,28,61],"conventional":[19,159],"register":[20,41,68,104,120,138,154,160,165],"as":[22,107,133,135],"first":[24],"step":[25],"without":[26],"assuming":[27],"schedule":[29],"lacks":[30],"information":[32],"of":[33,48,110,119],"interferences":[34],"between":[35],"values":[36],"live":[37],"ranges.":[38],"Thus,":[39],"allocator":[42],"may":[43],"introduce":[44],"an":[45,169,174],"excessive":[46],"amount":[47],"false":[49],"dependences":[50],"that":[51,176],"dramatically":[52],"reduce":[53],"ILP":[55],"(Instruction":[56],"Level":[57],"Parallelism).":[58],"We":[59,167,184],"present":[60],"new":[62,96],"theoretical":[63,196],"framework":[64],"for":[65],"controlling":[66],"pressure":[69,139],"before":[70],"pipelining.":[72],"Thus":[73],"based":[75],"on":[76,89,158,163],"inserting":[77],"some":[78],"anti-dependence":[79],"edges":[80],"(register":[81],"reuse":[82,86,123],"edges)":[83],"labeled":[84],"with":[85],"distances,":[87],"directly":[88],"data":[91],"dependence":[92],"graph.":[93],"In":[94],"this":[95],"graph,":[97],"we":[98],"are":[99],"able":[100],"to":[101,193],"fix":[102],"pressure,":[105],"measured":[106],"number":[109],"simultaneously":[111],"alive":[112],"variables":[113],"any":[115],"schedule.":[116],"The":[117],"determination":[118],"and":[121,173,201],"distance":[122],"parameterized":[125],"by":[126,136],"desired":[128],"minimum":[129],"initiation":[130],"interval":[131],"(MII)":[132],"well":[134],"constraints":[140],"-":[141],"either":[142],"can":[143],"be":[144],"minimized":[145],"while":[146],"other":[148],"one":[149],"fixed.":[151],"After":[152],"scheduling,":[153],"done":[157],"sets":[161],"rotating":[164],"files.":[166],"give":[168],"optimal":[170],"exact":[171],"model,":[172],"approximation":[175],"generalizes":[177],"Ning-Gao":[179],"[22]":[180],"buffer":[181],"optimization":[182],"method.":[183],"provide":[185],"experimental":[186],"results":[187],"which":[188],"show":[189],"good":[190],"improvement":[191],"compared":[192],"[22].":[194],"Our":[195],"model":[197],"considers":[198],"superscalar,":[199],"VLIW":[200],"EPIC/IA64":[202],"processors.":[203]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}