{"id":"https://openalex.org/W4240263428","doi":"https://doi.org/10.1109/cgo.2011.5764680","title":"Predictive modeling in a polyhedral optimization space","display_name":"Predictive modeling in a polyhedral optimization space","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W4240263428","doi":"https://doi.org/10.1109/cgo.2011.5764680"},"language":"en","primary_location":{"id":"doi:10.1109/cgo.2011.5764680","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2011.5764680","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium on Code Generation and Optimization (CGO 2011)","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/A5101998761","display_name":"Eun\u2010Jung Park","orcid":"https://orcid.org/0000-0002-3723-5351"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eunjung Park","raw_affiliation_strings":["University of Delaware, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Delaware, USA","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027811886","display_name":"Louis-Noel Pouche","orcid":null},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Louis-Noel Pouche","raw_affiliation_strings":["Ohio State University, Columbus, OH, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ohio State University, Columbus, OH, US","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103791820","display_name":"John Cavazos","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Cavazos","raw_affiliation_strings":["University of Delaware, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Delaware, USA","institution_ids":["https://openalex.org/I86501945"]}]},{"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/I4210126360","display_name":"Centre Inria de Saclay","ror":"https://ror.org/0315e5x55","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Albert Cohen","raw_affiliation_strings":["INRIA Saclay, Ile, \u00cele-de-France","INRIA Saclay, \u00cele-de-France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Saclay, Ile, \u00cele-de-France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]},{"raw_affiliation_string":"INRIA Saclay, \u00cele-de-France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027517817","display_name":"P. Sadayappan","orcid":"https://orcid.org/0000-0002-4737-2034"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Sadayappan","raw_affiliation_strings":["The Ohio State University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5201,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.83075523,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"119","last_page":"129"},"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.9916999936103821,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9915000200271606,"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/computer-science","display_name":"Computer science","score":0.7848465442657471},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6535943150520325},{"id":"https://openalex.org/keywords/polytope-model","display_name":"Polytope model","score":0.5912660360336304},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5774853229522705},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.487225204706192},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.4708264172077179},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.47004714608192444},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.4309334456920624},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.41722536087036133},{"id":"https://openalex.org/keywords/loop-optimization","display_name":"Loop optimization","score":0.41403627395629883},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4076884686946869},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3786720037460327},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3289145231246948},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17082923650741577},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16611173748970032},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14413121342658997},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.10606423020362854}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7848465442657471},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6535943150520325},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.5912660360336304},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5774853229522705},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.487225204706192},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.4708264172077179},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.47004714608192444},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.4309334456920624},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.41722536087036133},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.41403627395629883},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4076884686946869},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3786720037460327},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3289145231246948},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17082923650741577},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16611173748970032},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14413121342658997},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.10606423020362854},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cgo.2011.5764680","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2011.5764680","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium on Code Generation and Optimization (CGO 2011)","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":43,"referenced_works":["https://openalex.org/W1499644348","https://openalex.org/W1509875415","https://openalex.org/W1598202309","https://openalex.org/W1884835840","https://openalex.org/W1964031104","https://openalex.org/W1973923211","https://openalex.org/W2005985523","https://openalex.org/W2014244478","https://openalex.org/W2031775479","https://openalex.org/W2034761517","https://openalex.org/W2038543880","https://openalex.org/W2063249715","https://openalex.org/W2063774307","https://openalex.org/W2071110673","https://openalex.org/W2076290291","https://openalex.org/W2095776265","https://openalex.org/W2098180475","https://openalex.org/W2100933152","https://openalex.org/W2102182691","https://openalex.org/W2106296728","https://openalex.org/W2111334029","https://openalex.org/W2128249697","https://openalex.org/W2136952590","https://openalex.org/W2139143992","https://openalex.org/W2142079700","https://openalex.org/W2143124065","https://openalex.org/W2156286566","https://openalex.org/W2157273783","https://openalex.org/W2158626113","https://openalex.org/W2167209023","https://openalex.org/W2168519934","https://openalex.org/W2170753802","https://openalex.org/W2171539112","https://openalex.org/W2296218291","https://openalex.org/W2983923412","https://openalex.org/W3136479147","https://openalex.org/W3203568064","https://openalex.org/W4245206864","https://openalex.org/W4250700635","https://openalex.org/W6629867571","https://openalex.org/W6641237240","https://openalex.org/W6674545261","https://openalex.org/W6683085401"],"related_works":["https://openalex.org/W1665033356","https://openalex.org/W2083681681","https://openalex.org/W1877657449","https://openalex.org/W1488300410","https://openalex.org/W1597127505","https://openalex.org/W4246454774","https://openalex.org/W2091689272","https://openalex.org/W2034761517","https://openalex.org/W3151489216","https://openalex.org/W2166906890"],"abstract_inverted_index":{"Significant":[0],"advances":[1],"in":[2,8,53,148,183,244],"compiler":[3,43],"optimization":[4,44,94],"have":[5,45,67],"been":[6],"made":[7],"recent":[9],"years,":[10],"enabling":[11],"many":[12],"transformations":[13,35,66,218],"such":[14],"as":[15,198],"tiling,":[16,221],"fusion,":[17],"parallelization":[18,222],"and":[19,70,210,223],"vectorization":[20],"on":[21,121,206,232,237,257],"imperfectly":[22],"nested":[23],"loops.":[24],"Nevertheless,":[25],"the":[26,30,84,90,110,149,157,164,168,184,212,233,241],"problem":[27,165],"of":[28,33,92,109,113,159,166,202,214,240],"finding":[29],"best":[31,169],"combination":[32],"loop":[34],"remains":[36],"a":[37,75,106,200,203,228],"major":[38],"challenge.":[39],"Polyhedral":[40],"models":[41,62,81,176,195],"for":[42,49,55,227],"demonstrated":[46],"strong":[47],"potential":[48],"enhancing":[50],"program":[51,181,204],"performance,":[52],"particular":[54],"compute-intensive":[56],"applications.":[57],"But":[58,88],"existing":[59],"static":[60],"cost":[61],"to":[63,79,82,103,162,189],"optimize":[64],"polyhedral":[65,93,150,170,185,217],"significant":[68,107],"limitations,":[69],"iterative":[71],"compilation":[72],"has":[73,119],"become":[74],"very":[76,135],"promising":[77],"alternative":[78],"these":[80,175],"find":[83,145,179],"most":[85,246],"effective":[86],"transformations.":[87],"since":[89],"number":[91],"alternatives":[95],"can":[96,143,177],"be":[97],"enormous,":[98],"it":[99],"is":[100,252],"often":[101],"impractical":[102],"iterate":[104],"over":[105,123],"fraction":[108],"entire":[111],"space":[112,126],"polyhedrally":[114],"transformed":[115],"variants.":[116],"Recent":[117],"research":[118],"focused":[120],"iterating":[122],"this":[124,153],"search":[125,137,231],"either":[127],"with":[128,132],"manually-constructed":[129],"heuristics":[130],"or":[131],"automatic":[133],"but":[134],"expensive":[136],"algorithms":[138],"(e.g.,":[139],"genetic":[140],"algorithms)":[141],"that":[142,174,196,219],"eventually":[144],"good":[146],"points":[147],"space.":[151],"In":[152],"paper,":[154],"we":[155],"propose":[156],"use":[158],"machine":[160],"learning":[161],"address":[163],"selecting":[167],"optimizations.":[171],"We":[172,193,225],"show":[173],"quickly":[178],"high-performance":[180],"variants":[182],"space,":[186],"without":[187],"resorting":[188],"extensive":[190],"empirical":[191,230],"search.":[192],"introduce":[194],"take":[197],"input":[199],"characterization":[201],"based":[205],"its":[207],"dynamic":[208],"behavior,":[209],"predict":[211],"performance":[213],"aggressive":[215],"high-level":[216],"includes":[220],"vectorization.":[224],"allow":[226],"minimal":[229],"target":[234],"machine,":[235],"discovering":[236],"average":[238],"83%":[239],"search-space-optimal":[242],"combinations":[243],"at":[245],"5":[247],"runs.":[248],"Our":[249],"end-to-end":[250],"framework":[251],"validated":[253],"using":[254],"numerous":[255],"benchmarks":[256],"two":[258],"multi-core":[259],"platforms.":[260]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}