{"id":"https://openalex.org/W2291192259","doi":"https://doi.org/10.1145/2854038.2854048","title":"Opening polyhedral compiler's black box","display_name":"Opening polyhedral compiler's black box","publication_year":2016,"publication_date":"2016-02-29","ids":{"openalex":"https://openalex.org/W2291192259","doi":"https://doi.org/10.1145/2854038.2854048","mag":"2291192259"},"language":"en","primary_location":{"id":"doi:10.1145/2854038.2854048","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2854038.2854048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 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-01253322v1/file/2015.09.18_Polyhedral_Compiler_White_Boxing.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071663296","display_name":"L\u00e9na\u00efc Bagn\u00e8res","orcid":null},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210126360","display_name":"Inria Saclay - \u00cele de France","ror":"https://ror.org/0315e5x55","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"L\u00e9na\u00efc Bagn\u00e8res","raw_affiliation_strings":["INRIA, France / University of Paris-Saclay, France"],"affiliations":[{"raw_affiliation_string":"INRIA, France / University of Paris-Saclay, France","institution_ids":["https://openalex.org/I4210126360","https://openalex.org/I1326498283","https://openalex.org/I277688954"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034245897","display_name":"Oleksandr Zinenko","orcid":"https://orcid.org/0000-0003-1978-0222"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210126360","display_name":"Inria Saclay - \u00cele de France","ror":"https://ror.org/0315e5x55","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Oleksandr Zinenko","raw_affiliation_strings":["INRIA, France / University of Paris-Saclay, France"],"affiliations":[{"raw_affiliation_string":"INRIA, France / University of Paris-Saclay, France","institution_ids":["https://openalex.org/I4210126360","https://openalex.org/I1326498283","https://openalex.org/I277688954"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109058773","display_name":"St\u00e9phane Huot","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"St\u00e9phane Huot","raw_affiliation_strings":["INRIA, France"],"affiliations":[{"raw_affiliation_string":"INRIA, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024483254","display_name":"C\u00e9dric Bastoul","orcid":"https://orcid.org/0000-0002-7164-8213"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","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":"C\u00e9dric Bastoul","raw_affiliation_strings":["University of Strasbourg, France / INRIA, France"],"affiliations":[{"raw_affiliation_string":"University of Strasbourg, France / INRIA, France","institution_ids":["https://openalex.org/I68947357","https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5071663296"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210126360"],"apc_list":null,"apc_paid":null,"fwci":4.8156,"has_fulltext":true,"cited_by_count":38,"citation_normalized_percentile":{"value":0.9502374,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"128","last_page":"138"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9947999715805054,"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"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9939000010490417,"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.8767082095146179},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.8211549520492554},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.7481104731559753},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.6518534421920776},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6152953505516052},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5890562534332275},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5349107384681702},{"id":"https://openalex.org/keywords/program-optimization","display_name":"Program optimization","score":0.5301844477653503},{"id":"https://openalex.org/keywords/loop-optimization","display_name":"Loop optimization","score":0.456759512424469},{"id":"https://openalex.org/keywords/interprocedural-optimization","display_name":"Interprocedural optimization","score":0.41406866908073425},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.4130858778953552},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.21154898405075073},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13324561715126038}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8767082095146179},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.8211549520492554},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.7481104731559753},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.6518534421920776},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6152953505516052},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5890562534332275},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5349107384681702},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.5301844477653503},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.456759512424469},{"id":"https://openalex.org/C111564260","wikidata":"https://www.wikidata.org/wiki/Q4288856","display_name":"Interprocedural optimization","level":5,"score":0.41406866908073425},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.4130858778953552},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.21154898405075073},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13324561715126038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"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":3,"locations":[{"id":"doi:10.1145/2854038.2854048","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2854038.2854048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 International Symposium on Code Generation and Optimization","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01253322v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01253322","pdf_url":"https://inria.hal.science/hal-01253322v1/file/2015.09.18_Polyhedral_Compiler_White_Boxing.pdf","source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cgo.org/cgo2016/","raw_type":"Conference papers"},{"id":"pmh:oai:HAL:hal-04231834v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04231834","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://dl.acm.org/doi/10.1145/2854038.2854048","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01253322v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01253322","pdf_url":"https://inria.hal.science/hal-01253322v1/file/2015.09.18_Polyhedral_Compiler_White_Boxing.pdf","source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cgo.org/cgo2016/","raw_type":"Conference papers"},"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2291192259.pdf","grobid_xml":"https://content.openalex.org/works/W2291192259.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1499056557","https://openalex.org/W1500721915","https://openalex.org/W1547909858","https://openalex.org/W1558370006","https://openalex.org/W1598202309","https://openalex.org/W1844404537","https://openalex.org/W1970141743","https://openalex.org/W2000872713","https://openalex.org/W2028240990","https://openalex.org/W2031775479","https://openalex.org/W2034761517","https://openalex.org/W2051305716","https://openalex.org/W2071110673","https://openalex.org/W2084017642","https://openalex.org/W2093260610","https://openalex.org/W2112482891","https://openalex.org/W2112502633","https://openalex.org/W2561675875","https://openalex.org/W2606963276","https://openalex.org/W2615583977","https://openalex.org/W3203568064","https://openalex.org/W4412288940","https://openalex.org/W6676870935","https://openalex.org/W6736295056"],"related_works":["https://openalex.org/W2083681681","https://openalex.org/W1488300410","https://openalex.org/W1597127505","https://openalex.org/W1877657449","https://openalex.org/W2577630842","https://openalex.org/W2001356339","https://openalex.org/W3169195854","https://openalex.org/W2013570895","https://openalex.org/W4220800565","https://openalex.org/W2172096703"],"abstract_inverted_index":{"While":[0],"compilers":[1],"offer":[2],"a":[3,59,64,74,95],"fair":[4],"trade-off":[5],"between":[6],"productivity":[7],"and":[8,47,127],"executable":[9],"performance":[10],"in":[11,51,63,133],"single-threaded":[12],"execution,":[13],"their":[14],"optimizations":[15,31,131],"remain":[16],"fragile":[17],"when":[18],"addressing":[19],"compute-intensive":[20],"code":[21],"for":[22,37],"parallel":[23],"architectures":[24],"with":[25,42,135],"deep":[26],"memory":[27],"hierarchies.":[28],"Moreover,":[29],"these":[30],"operate":[32],"as":[33,101,103],"black":[34,115],"boxes,":[35],"impenetrable":[36],"the":[38,114,118,136],"user,":[39],"leaving":[40],"them":[41],"no":[43],"alternative":[44],"to":[45,77,123],"time-consuming":[46],"error-prone":[48],"manual":[49],"optimization":[50,66,88,105],"cases":[52],"where":[53],"an":[54,80],"imprecise":[55],"cost":[56],"model":[57],"or":[58],"weak":[60],"analysis":[61],"resulted":[62],"bad":[65],"decision.":[67],"To":[68],"address":[69],"this":[70,104],"issue,":[71],"we":[72],"propose":[73],"technique":[75],"allowing":[76],"automatically":[78],"translate":[79],"arbitrary":[81],"polyhedral":[82,119],"optimization,":[83],"used":[84],"internally":[85],"by":[86],"loop-level":[87],"frameworks":[89,120],"of":[90,97,117],"several":[91],"modern":[92],"compilers,":[93],"into":[94],"sequence":[96],"comprehensible":[98],"syntactic":[99],"transformations":[100],"long":[102],"focuses":[106],"on":[107],"scheduling":[108],"loop":[109],"iterations.":[110],"This":[111],"approach":[112],"opens":[113],"box":[116],"enabling":[121],"users":[122],"examine,":[124],"refine,":[125],"replay":[126],"even":[128],"design":[129],"complex":[130],"semi-automatically":[132],"partnership":[134],"compiler.":[137]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}