{"id":"https://openalex.org/W2793376792","doi":"https://doi.org/10.1145/3168815","title":"DeLICM: scalar dependence removal at zero memory cost","display_name":"DeLICM: scalar dependence removal at zero memory cost","publication_year":2018,"publication_date":"2018-02-24","ids":{"openalex":"https://openalex.org/W2793376792","doi":"https://doi.org/10.1145/3168815","mag":"2793376792"},"language":"en","primary_location":{"id":"doi:10.1145/3168815","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3168815","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 International Symposium on Code Generation and Optimization","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-01814183/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077795200","display_name":"Michael Kruse","orcid":"https://orcid.org/0000-0001-7756-7126"},"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":"Michael Kruse","raw_affiliation_strings":["Inria, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055618037","display_name":"Tobias Grosser","orcid":"https://orcid.org/0000-0003-3874-6003"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Tobias Grosser","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7126,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68735579,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"241","last_page":"253"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9958999752998352,"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/compiler","display_name":"Compiler","score":0.8688426613807678},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7995443344116211},{"id":"https://openalex.org/keywords/loop-optimization","display_name":"Loop optimization","score":0.6944184303283691},{"id":"https://openalex.org/keywords/scalar","display_name":"Scalar (mathematics)","score":0.6634581685066223},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.6411731243133545},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6298243999481201},{"id":"https://openalex.org/keywords/interprocedural-optimization","display_name":"Interprocedural optimization","score":0.597900927066803},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46188706159591675},{"id":"https://openalex.org/keywords/pipeline-transport","display_name":"Pipeline transport","score":0.4226442575454712},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.317497581243515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12699255347251892}],"concepts":[{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.8688426613807678},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7995443344116211},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.6944184303283691},{"id":"https://openalex.org/C57691317","wikidata":"https://www.wikidata.org/wiki/Q1289248","display_name":"Scalar (mathematics)","level":2,"score":0.6634581685066223},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.6411731243133545},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6298243999481201},{"id":"https://openalex.org/C111564260","wikidata":"https://www.wikidata.org/wiki/Q4288856","display_name":"Interprocedural optimization","level":5,"score":0.597900927066803},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46188706159591675},{"id":"https://openalex.org/C175309249","wikidata":"https://www.wikidata.org/wiki/Q725864","display_name":"Pipeline transport","level":2,"score":0.4226442575454712},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.317497581243515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12699255347251892},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C87717796","wikidata":"https://www.wikidata.org/wiki/Q146326","display_name":"Environmental engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3168815","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3168815","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 International Symposium on Code Generation and Optimization","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01814183v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01814183","pdf_url":"https://inria.hal.science/hal-01814183/document","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CGO'18 - International Symposium on Code Generation and Optimization, Feb 2018, Vienna, Austria. pp.241-253, ⟨10.1145/3168815⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01814183v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01814183","pdf_url":"https://inria.hal.science/hal-01814183/document","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CGO'18 - International Symposium on Code Generation and Optimization, Feb 2018, Vienna, Austria. pp.241-253, ⟨10.1145/3168815⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2793376792.pdf","grobid_xml":"https://content.openalex.org/works/W2793376792.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W1518413278","https://openalex.org/W1557064363","https://openalex.org/W1751458545","https://openalex.org/W1782174992","https://openalex.org/W1970141743","https://openalex.org/W2003804316","https://openalex.org/W2010196134","https://openalex.org/W2034761517","https://openalex.org/W2043555680","https://openalex.org/W2046382913","https://openalex.org/W2049487370","https://openalex.org/W2051305716","https://openalex.org/W2070961300","https://openalex.org/W2077143534","https://openalex.org/W2077805988","https://openalex.org/W2078738604","https://openalex.org/W2084917734","https://openalex.org/W2102976251","https://openalex.org/W2135736783","https://openalex.org/W2294053719","https://openalex.org/W2294743625","https://openalex.org/W2296556828","https://openalex.org/W2310545733","https://openalex.org/W2334282563","https://openalex.org/W2336298921","https://openalex.org/W2511242544","https://openalex.org/W2522802439","https://openalex.org/W2556804450","https://openalex.org/W2983923412","https://openalex.org/W3151489216","https://openalex.org/W4245643018","https://openalex.org/W4254778071"],"related_works":["https://openalex.org/W2083681681","https://openalex.org/W4246454774","https://openalex.org/W2121223013","https://openalex.org/W2091689272","https://openalex.org/W1488300410","https://openalex.org/W1597127505","https://openalex.org/W2053033210","https://openalex.org/W4220800565","https://openalex.org/W1877657449","https://openalex.org/W2411334977"],"abstract_inverted_index":{"Increasing":[0],"data":[1],"movement":[2],"costs":[3],"motivate":[4],"the":[5,12,33,58,124],"integration":[6],"of":[7,16,69],"polyhedral":[8,20,75,134],"loop":[9,135],"optimizers":[10,21,45],"in":[11,39],"standard":[13],"flow":[14],"(-O3)":[15],"production":[17],"compilers.":[18],"While":[19],"have":[22],"been":[23],"shown":[24],"to":[25,88],"be":[26,138],"effective":[27,62],"when":[28],"applied":[29],"as":[30],"source-to-source":[31],"transformation,":[32],"single":[34,54],"static":[35],"assignment":[36],"form":[37],"used":[38],"modern":[40],"compiler":[41,142],"mid-ends":[42],"makes":[43],"such":[44],"less":[46],"effective.":[47],"Scalar":[48],"dependencies":[49,109],"(dependencies":[50],"carried":[51],"over":[52],"a":[53,67,74,132],"memory":[55,86,129],"location)":[56],"are":[57],"main":[59],"obstacle":[60],"preventing":[61],"optimization.":[63,150],"We":[64],"present":[65],"DeLICM,":[66],"set":[68],"transformations":[70],"which,":[71],"backed":[72],"by":[73,82,93,111],"value":[76],"analysis,":[77],"eliminate":[78],"problematic":[79],"scalar":[80,85,100],"dependences":[81],"1)":[83],"relocating":[84],"references":[87],"unused":[89],"array":[90],"locations":[91],"and":[92],"2)":[94],"forwarding":[95],"computations":[96],"that":[97,105],"otherwise":[98],"cause":[99],"dependences.":[101],"Our":[102],"experiments":[103],"show":[104],"DeLICM":[106],"effectively":[107],"eliminates":[108],"introduced":[110],"compiler-internal":[112],"canonicalization":[113],"passes,":[114],"human":[115],"programmers,":[116],"optimizing":[117],"code":[118],"generators,":[119],"or":[120],"inlining":[121],"--":[122],"without":[123],"need":[125],"for":[126,148],"any":[127],"additional":[128],"allocation.":[130],"As":[131],"result,":[133],"optimizations":[136],"can":[137],"better":[139],"integrated":[140],"into":[141],"pass":[143],"pipelines":[144],"which":[145],"is":[146],"essential":[147],"metaprogramming":[149]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}