{"id":"https://openalex.org/W4237305187","doi":"https://doi.org/10.1109/icpp.2004.1327911","title":"Low-cost register-pressure prediction for scalar replacement using pseudo-schedules","display_name":"Low-cost register-pressure prediction for scalar replacement using pseudo-schedules","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W4237305187","doi":"https://doi.org/10.1109/icpp.2004.1327911"},"language":"en","primary_location":{"id":"doi:10.1109/icpp.2004.1327911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2004.1327911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Conference on Parallel Processing, 2004. ICPP 2004.","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/A5057636149","display_name":"Y. Ma","orcid":null},"institutions":[{"id":"https://openalex.org/I11957088","display_name":"Michigan Technological University","ror":"https://ror.org/0036rpn28","country_code":"US","type":"education","lineage":["https://openalex.org/I11957088"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Y. Ma","raw_affiliation_strings":["Department of Computer Science, Michigan Technological University, Houghton, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Michigan Technological University, Houghton, MI, USA","institution_ids":["https://openalex.org/I11957088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002599549","display_name":"Steve Carr","orcid":"https://orcid.org/0000-0002-8922-0805"},"institutions":[{"id":"https://openalex.org/I11957088","display_name":"Michigan Technological University","ror":"https://ror.org/0036rpn28","country_code":"US","type":"education","lineage":["https://openalex.org/I11957088"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Carr","raw_affiliation_strings":["Department of Computer Science, Michigan Technological University, Houghton, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Michigan Technological University, Houghton, MI, USA","institution_ids":["https://openalex.org/I11957088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078317921","display_name":"R. Ge","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"R. Ge","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, Burnaby, BC, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Burnaby, BC, Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057636149"],"corresponding_institution_ids":["https://openalex.org/I11957088"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.39330649,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"116","last_page":"124 vol.1"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9990000128746033,"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/T10904","display_name":"Embedded Systems Design 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"}}],"keywords":[{"id":"https://openalex.org/keywords/register-allocation","display_name":"Register allocation","score":0.9452754855155945},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7110733985900879},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6606801152229309},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6138633489608765},{"id":"https://openalex.org/keywords/software-pipelining","display_name":"Software pipelining","score":0.6123237013816833},{"id":"https://openalex.org/keywords/register","display_name":"Register (sociolinguistics)","score":0.5057981014251709},{"id":"https://openalex.org/keywords/scalar","display_name":"Scalar (mathematics)","score":0.4980931282043457},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4975767433643341},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.4906260073184967},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.454096257686615},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43792515993118286},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.4242042005062103},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19416776299476624},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14028400182724},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12006255984306335},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11569741368293762},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09942615032196045}],"concepts":[{"id":"https://openalex.org/C128916667","wikidata":"https://www.wikidata.org/wiki/Q1343660","display_name":"Register allocation","level":3,"score":0.9452754855155945},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7110733985900879},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6606801152229309},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6138633489608765},{"id":"https://openalex.org/C188854837","wikidata":"https://www.wikidata.org/wiki/Q268469","display_name":"Software pipelining","level":3,"score":0.6123237013816833},{"id":"https://openalex.org/C2779235478","wikidata":"https://www.wikidata.org/wiki/Q286576","display_name":"Register (sociolinguistics)","level":2,"score":0.5057981014251709},{"id":"https://openalex.org/C57691317","wikidata":"https://www.wikidata.org/wiki/Q1289248","display_name":"Scalar (mathematics)","level":2,"score":0.4980931282043457},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4975767433643341},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.4906260073184967},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.454096257686615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43792515993118286},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.4242042005062103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19416776299476624},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14028400182724},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12006255984306335},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11569741368293762},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09942615032196045},{"id":"https://openalex.org/C548081761","wikidata":"https://www.wikidata.org/wiki/Q180388","display_name":"Waste management","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icpp.2004.1327911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2004.1327911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Conference on Parallel Processing, 2004. ICPP 2004.","raw_type":"proceedings-article"},{"id":"pmh:oai:digitalcommons.mtu.edu:michigantech-p-29896","is_oa":false,"landing_page_url":"https://digitalcommons.mtu.edu/michigantech-p/10594","pdf_url":null,"source":{"id":"https://openalex.org/S4377196391","display_name":"Digital Commons - Michigan Tech (Michigan Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I11957088","host_organization_name":"Michigan Technological University","host_organization_lineage":["https://openalex.org/I11957088"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Michigan Tech Publications, Part 1","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1963718362","https://openalex.org/W1966708457","https://openalex.org/W1999362312","https://openalex.org/W2017482298","https://openalex.org/W2025049323","https://openalex.org/W2057577013","https://openalex.org/W2123412205","https://openalex.org/W2296760900","https://openalex.org/W4232919122","https://openalex.org/W4234643798","https://openalex.org/W4251798485"],"related_works":["https://openalex.org/W3013232686","https://openalex.org/W2145456033","https://openalex.org/W18945967","https://openalex.org/W4244928472","https://openalex.org/W2159458033","https://openalex.org/W1844463772","https://openalex.org/W2045503187","https://openalex.org/W4249499534","https://openalex.org/W2012512596","https://openalex.org/W2010347046"],"abstract_inverted_index":{"Scalar":[0],"replacement":[1,50,83],"is":[2],"an":[3],"effective":[4],"optimization":[5],"for":[6,91,101,108,120],"removing":[7],"memory":[8],"accesses.":[9],"However,":[10],"exposing":[11],"all":[12],"possible":[13],"array":[14],"reuse":[15],"with":[16,147,169],"scalars":[17],"may":[18],"cause":[19],"a":[20,35,45,92,103,114,122,148],"significant":[21],"increase":[22],"in":[23,27,154],"register":[24,28,42,57,71,86,132,140],"pressure,":[25],"resulting":[26],"spilling":[29,87],"and":[30,70,118,137],"performance":[31,159],"degradation.":[32],"We":[33],"present":[34],"low":[36],"cost":[37],"method":[38],"to":[39,75,85,160],"predict":[40],"the":[41,64,77,110,130,138,161,174],"pressure":[43,133,141],"of":[44,66,79,113,151,173],"loop":[46],"before":[47],"applying":[48],"scalar":[49,82],"on":[51,145,177],"high-level":[52],"source":[53],"code,":[54],"called":[55],"pseudo-schedule":[56],"prediction":[58],"(PRP),":[59],"that":[60,127],"takes":[61],"into":[62],"account":[63],"effects":[65],"both":[67],"software":[68,115],"pipelining":[69],"allocation.":[72],"PRP":[73,95,128,156],"attempts":[74],"eliminate":[76],"possibility":[78],"degradation":[80],"from":[81],"due":[84],"while":[88],"providing":[89],"opportunities":[90],"good":[93],"speedup.":[94],"uses":[96],"three":[97],"approximation":[98],"algorithms:":[99],"one":[100,107,119],"constructing":[102],"data":[104],"dependence":[105],"graph,":[106],"computing":[109],"recurrence":[111],"constraints":[112],"pipelined":[116],"loop,":[117],"building":[121],"pseudo-schedule.":[123],"Our":[124],"experiments":[125],"show":[126],"predicts":[129],"floating-point":[131],"within":[134,142],"2":[135],"registers":[136,144],"integer":[139],"2.7":[143],"average":[146],"time":[149,176],"complexity":[150],"O(n/sup":[152,166],"2/)":[153],"practice.":[155],"achieves":[157],"similar":[158],"best":[162],"previous":[163],"approach,":[164],"having":[165],"3/)":[167],"complexity,":[168],"less":[170],"than":[171],"one-fourth":[172],"compilation":[175],"our":[178],"test":[179],"suite.":[180]},"counts_by_year":[],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}