{"id":"https://openalex.org/W2250964545","doi":"https://doi.org/10.1145/2838734","title":"The Polyhedral Model of Nonlinear Loops","display_name":"The Polyhedral Model of Nonlinear Loops","publication_year":2015,"publication_date":"2015-12-08","ids":{"openalex":"https://openalex.org/W2250964545","doi":"https://doi.org/10.1145/2838734","mag":"2250964545"},"language":"en","primary_location":{"id":"doi:10.1145/2838734","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2838734","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2838734&type=pdf","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2838734&type=pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015460842","display_name":"Aravind Sukumaran-Rajam","orcid":"https://orcid.org/0000-0002-4062-0293"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"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/I68947357","display_name":"Universit\u00e9 de Strasbourg","ror":"https://ror.org/00pg6eq24","country_code":"FR","type":"education","lineage":["https://openalex.org/I68947357"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Aravind Sukumaran-Rajam","raw_affiliation_strings":["INRIA, Team CAMUS, ICube Lab, CNRS, University of Strasbourg, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA, Team CAMUS, ICube Lab, CNRS, University of Strasbourg, France","institution_ids":["https://openalex.org/I68947357","https://openalex.org/I1326498283","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069005561","display_name":"Philippe Clauss","orcid":"https://orcid.org/0000-0002-5759-9195"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"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/I68947357","display_name":"Universit\u00e9 de Strasbourg","ror":"https://ror.org/00pg6eq24","country_code":"FR","type":"education","lineage":["https://openalex.org/I68947357"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Philippe Clauss","raw_affiliation_strings":["INRIA, Team CAMUS, ICube Lab, CNRS, University of Strasbourg, France","MULTICORE (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA, Team CAMUS, ICube Lab, CNRS, University of Strasbourg, France","institution_ids":["https://openalex.org/I68947357","https://openalex.org/I1326498283","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"MULTICORE (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9766,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.86701209,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"4","first_page":"1","last_page":"27"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991999864578247,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9991999864578247,"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.8276244401931763},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5972126722335815},{"id":"https://openalex.org/keywords/polytope-model","display_name":"Polytope model","score":0.5918559432029724},{"id":"https://openalex.org/keywords/speculative-multithreading","display_name":"Speculative multithreading","score":0.544322669506073},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.520146906375885},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4932531714439392},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.4808712601661682},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4364878535270691},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.4270051419734955},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.41350167989730835},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3444451689720154},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3217161297798157},{"id":"https://openalex.org/keywords/multithreading","display_name":"Multithreading","score":0.2614649534225464},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10218921303749084},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.10027730464935303}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8276244401931763},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5972126722335815},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.5918559432029724},{"id":"https://openalex.org/C15296174","wikidata":"https://www.wikidata.org/wiki/Q7575343","display_name":"Speculative multithreading","level":4,"score":0.544322669506073},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.520146906375885},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4932531714439392},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.4808712601661682},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4364878535270691},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.4270051419734955},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.41350167989730835},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3444451689720154},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3217161297798157},{"id":"https://openalex.org/C201410400","wikidata":"https://www.wikidata.org/wiki/Q1064412","display_name":"Multithreading","level":3,"score":0.2614649534225464},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10218921303749084},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.10027730464935303},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2838734","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2838734","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2838734&type=pdf","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01244464v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01244464","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":"ACM Transactions on Architecture and Code Optimization, 2016, 12 (4), ⟨10.1145/2838734⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"doi:10.1145/2838734","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2838734","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2838734&type=pdf","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.550000011920929,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2250964545.pdf","grobid_xml":"https://content.openalex.org/works/W2250964545.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W108320310","https://openalex.org/W288065879","https://openalex.org/W1570965180","https://openalex.org/W1837593827","https://openalex.org/W1986188487","https://openalex.org/W1988659054","https://openalex.org/W1999625132","https://openalex.org/W2004881145","https://openalex.org/W2023128081","https://openalex.org/W2025278624","https://openalex.org/W2034073536","https://openalex.org/W2034761517","https://openalex.org/W2035463980","https://openalex.org/W2077143534","https://openalex.org/W2078429521","https://openalex.org/W2080592089","https://openalex.org/W2087532885","https://openalex.org/W2117007419","https://openalex.org/W2125340270","https://openalex.org/W2127799876","https://openalex.org/W2136938453","https://openalex.org/W2139795587","https://openalex.org/W2149037641","https://openalex.org/W2154795299","https://openalex.org/W2155632873","https://openalex.org/W3194081636","https://openalex.org/W4232909587","https://openalex.org/W4246500121","https://openalex.org/W4250981365","https://openalex.org/W4295539146"],"related_works":["https://openalex.org/W2023832055","https://openalex.org/W2082485924","https://openalex.org/W2105895556","https://openalex.org/W2213849224","https://openalex.org/W1985089255","https://openalex.org/W2115561485","https://openalex.org/W2153202644","https://openalex.org/W2125768521","https://openalex.org/W2106625514","https://openalex.org/W2527038815"],"abstract_inverted_index":{"Runtime":[0],"code":[1,45,49,271],"optimization":[2],"and":[3,17,23,48,69,130,179,201,222,252],"speculative":[4,102],"execution":[5],"are":[6,104,118,196,225],"becoming":[7],"increasingly":[8],"prominent":[9],"to":[10,71,93,128,145,216,242,255],"leverage":[11],"performance":[12],"in":[13,75],"the":[14,34,53,64,73,78,94,114,139,142,181,194,234,237,256,261],"current":[15,135],"multi-":[16],"many-core":[18],"era.":[19],"However,":[20],"a":[21,81,97,124,172,210,243,276],"wider":[22,244],"more":[24,112],"efficient":[25],"use":[26],"of":[27,52,80,89,96,107,116,141,151,236,246,263],"such":[28],"techniques":[29],"is":[30,123,171],"mainly":[31],"hampered":[32],"by":[33,39,185],"prohibitive":[35],"time":[36],"overhead":[37],"induced":[38],"centralized":[40,82],"data":[41,90,98],"race":[42],"detection,":[43],"dynamic":[44],"behavior":[46],"modeling,":[47],"generation.":[50],"Most":[51],"existing":[54],"Thread":[55],"Level":[56],"Speculation":[57],"(TLS)":[58],"systems":[59,103],"rely":[60],"on":[61],"naively":[62],"slicing":[63],"target":[65],"loops":[66],"into":[67],"chunks":[68,74],"trying":[70],"execute":[72],"parallel":[76],"with":[77,158],"help":[79],"performance-penalizing":[83],"verification":[84],"module":[85],"that":[86,174,213],"takes":[87],"care":[88],"races.":[91],"Due":[92],"lack":[95],"dependence":[99,257],"model,":[100],"these":[101,152],"not":[105,226],"capable":[106],"doing":[108],"advanced":[109],"transformations,":[110],"and,":[111],"importantly,":[113],"chances":[115],"rollback":[117],"high.":[119],"The":[120,134],"polyhedral":[121,143,182,204,238,264],"model":[122,127,144,183,239,259],"well-known":[125],"mathematical":[126],"analyze":[129],"optimize":[131],"loop":[132,223,265],"nests.":[133],"state-of-art":[136],"tools":[137,153],"limit":[138],"application":[140,262],"static":[146],"control":[147],"codes.":[148,247],"Thus,":[149],"none":[150],"can":[154,189],"generally":[155],"handle":[156,217],"codes":[157,195,218],"while":[159,273],"loops,":[160],"indirect":[161],"memory":[162,220],"accesses,":[163],"or":[164,199],"pointers.":[165],"Apollo":[166,188,215],"(Automatic":[167],"POLyhedral":[168],"Loop":[169],"Optimizer)":[170],"framework":[173],"goes":[175],"one":[176],"step":[177],"beyond":[178],"applies":[180,203],"dynamically":[184],"using":[186],"TLS.":[187],"predict,":[190],"at":[191,240],"runtime,":[192],"whether":[193],"behaving":[197],"linearly":[198],"not,":[200],"it":[202],"transformations":[205,267],"on-the-fly.":[206],"This":[207],"article":[208],"presents":[209],"novel":[211],"system":[212],"enables":[214,260],"whose":[219],"accesses":[221,254],"bounds":[224],"necessarily":[227],"linear.":[228],"More":[229],"generally,":[230],"this":[231],"approach":[232],"expands":[233],"applicability":[235],"runtime":[241],"class":[245],"Plugging":[248],"together":[249],"both":[250],"linear":[251],"nonlinear":[253,270],"prediction":[258],"optimizing":[266],"even":[268],"for":[269],"kernels":[272],"also":[274],"allowing":[275],"low-cost":[277],"speculation":[278],"verification.":[279]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}