{"id":"https://openalex.org/W2139143992","doi":"https://doi.org/10.1109/cgo.2007.21","title":"Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time","display_name":"Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time","publication_year":2007,"publication_date":"2007-03-01","ids":{"openalex":"https://openalex.org/W2139143992","doi":"https://doi.org/10.1109/cgo.2007.21","mag":"2139143992"},"language":"en","primary_location":{"id":"doi:10.1109/cgo.2007.21","doi":"https://doi.org/10.1109/cgo.2007.21","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2007.21","pdf_url":null,"source":{"id":"https://openalex.org/S4393918247","display_name":"Proceedings of the CGO/Proceedings of the ... CGO","issn_l":"2164-2397","issn":["2164-2397"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium on Code Generation and Optimization (CGO'07)","raw_type":"proceedings-article"},"volume":null,"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/A5040769038","display_name":"Louis-No\u00ebl Pouchet","orcid":"https://orcid.org/0000-0001-5103-3097","observed_orcids":["https://orcid.org/0000-0001-5103-3097"]},"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":"Louis-Noel Pouchet","raw_affiliation_strings":["ALCHEMY Group, INRIA FUTURS and Paris-Sud University, France","ALCHEMY Group, INRIA FUTURS and Paris-Sud University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ALCHEMY Group, INRIA FUTURS and Paris-Sud University, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"ALCHEMY Group, INRIA FUTURS and Paris-Sud University#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024483254","display_name":"C\u00e9dric Bastoul","orcid":"https://orcid.org/0000-0002-7164-8213","observed_orcids":["https://orcid.org/0000-0002-7164-8213"]},"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":"Cedric Bastoul","raw_affiliation_strings":["ALCHEMY Group, INRIA FUTURS and Paris-Sud University, France","ALCHEMY Group, INRIA FUTURS and Paris-Sud University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ALCHEMY Group, INRIA FUTURS and Paris-Sud University, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"ALCHEMY Group, INRIA FUTURS and Paris-Sud University#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063162788","display_name":"Albert Cohen","orcid":"https://orcid.org/0000-0002-8866-5343","observed_orcids":["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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Albert Cohen","raw_affiliation_strings":["ALCHEMY Group, INRIA FUTURS and Paris-Sud University, France","ALCHEMY Group, INRIA FUTURS and Paris-Sud University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ALCHEMY Group, INRIA FUTURS and Paris-Sud University, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"ALCHEMY Group, INRIA FUTURS and Paris-Sud University#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017292577","display_name":"Nicolas Vasilache","orcid":"https://orcid.org/0000-0002-4096-3325","observed_orcids":["https://orcid.org/0000-0002-4096-3325"]},"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":"Nicolas Vasilache","raw_affiliation_strings":["ALCHEMY Group, INRIA FUTURS and Paris-Sud University, France","ALCHEMY Group, INRIA FUTURS and Paris-Sud University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ALCHEMY Group, INRIA FUTURS and Paris-Sud University, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"ALCHEMY Group, INRIA FUTURS and Paris-Sud University#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":8.574,"has_fulltext":false,"cited_by_count":120,"citation_normalized_percentile":{"value":0.98587724,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"144","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9984999895095825,"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":0.9984999895095825,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.0003000000142492354,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/iterative-optimization","display_name":"iterative optimization","score":0.9629999995231628},{"id":"https://openalex.org/keywords/polyhedral-models","display_name":"polyhedral models","score":0.9890000224113464},{"id":"https://openalex.org/keywords/loop-transformation","display_name":"loop transformation","score":0.8560000061988831},{"id":"https://openalex.org/keywords/compiler-optimization","display_name":"compiler optimization","score":0.5830000042915344},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"parallel computing","score":0.4320000112056732},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"memory hierarchy","score":0.8230000138282776}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7570619583129883},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.733741283416748},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7121403217315674},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.6166890263557434},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5893404483795166},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.562105119228363},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.5432513952255249},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5057427883148193},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.4925740361213684},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48132550716400146},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.47501716017723083},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.4675143361091614},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46367689967155457},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4403522312641144},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.437202513217926},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4296032190322876},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41926804184913635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19660061597824097},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11731579899787903},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08817973732948303},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/cgo.2007.21","doi":"https://doi.org/10.1109/cgo.2007.21","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2007.21","pdf_url":null,"source":{"id":"https://openalex.org/S4393918247","display_name":"Proceedings of the CGO/Proceedings of the ... CGO","issn_l":"2164-2397","issn":["2164-2397"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium on Code Generation and Optimization (CGO'07)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.162.1551","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.162.1551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lri.fr/~bastoul/research/papers/PBCV07-CGO.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.174.7348","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.7348","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-rocq.inria.fr/%7Epouchet/doc/cgo-article.07.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.76.4940","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.4940","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-rocq.inria.fr/~acohen/publications/PBCV07.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01257281v1","doi":null,"is_oa":false,"landing_page_url":"https://hal.science/hal-01257281","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Intl. Symp. on Code Generation and Optimization (CGO), 2007, San Jose, California, United States","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":69,"referenced_works":["https://openalex.org/W350392096","https://openalex.org/W1486289306","https://openalex.org/W1494930385","https://openalex.org/W1499056557","https://openalex.org/W1500117749","https://openalex.org/W1509875415","https://openalex.org/W1514857085","https://openalex.org/W1521790034","https://openalex.org/W1530670596","https://openalex.org/W1533186609","https://openalex.org/W1551313092","https://openalex.org/W1569608833","https://openalex.org/W1600567712","https://openalex.org/W1639032689","https://openalex.org/W1708603942","https://openalex.org/W1776224102","https://openalex.org/W1884835840","https://openalex.org/W1887913568","https://openalex.org/W1910659465","https://openalex.org/W1963547452","https://openalex.org/W1970141743","https://openalex.org/W1984771329","https://openalex.org/W1995270665","https://openalex.org/W2005985523","https://openalex.org/W2013981372","https://openalex.org/W2029165396","https://openalex.org/W2038543880","https://openalex.org/W2042629708","https://openalex.org/W2052356107","https://openalex.org/W2052934867","https://openalex.org/W2059277585","https://openalex.org/W2071110673","https://openalex.org/W2072198393","https://openalex.org/W2074367725","https://openalex.org/W2076485607","https://openalex.org/W2080756777","https://openalex.org/W2085376012","https://openalex.org/W2097699872","https://openalex.org/W2098925700","https://openalex.org/W2100660812","https://openalex.org/W2100664615","https://openalex.org/W2101924328","https://openalex.org/W2103412683","https://openalex.org/W2108315152","https://openalex.org/W2112482891","https://openalex.org/W2118937112","https://openalex.org/W2119609467","https://openalex.org/W2119691711","https://openalex.org/W2128249697","https://openalex.org/W2137311321","https://openalex.org/W2143124065","https://openalex.org/W2143151059","https://openalex.org/W2154175721","https://openalex.org/W2158958889","https://openalex.org/W2159360349","https://openalex.org/W2168412050","https://openalex.org/W2168519934","https://openalex.org/W2170216784","https://openalex.org/W2170753802","https://openalex.org/W2340604309","https://openalex.org/W2596430081","https://openalex.org/W2609112314","https://openalex.org/W2615583977","https://openalex.org/W2983923412","https://openalex.org/W3006533007","https://openalex.org/W4233894383","https://openalex.org/W4285719527","https://openalex.org/W4301808069","https://openalex.org/W6637804602"],"related_works":["https://openalex.org/W7098654345","https://openalex.org/W7098940310","https://openalex.org/W2747830075","https://openalex.org/W4299846067","https://openalex.org/W3009106325","https://openalex.org/W2140759628","https://openalex.org/W7098524649","https://openalex.org/W7098396699","https://openalex.org/W2570152998","https://openalex.org/W2596430081"],"abstract_inverted_index":{"Emerging":[0],"microprocessors":[1],"offer":[2],"unprecedented":[3],"parallel":[4],"computing":[5],"capabilities":[6],"and":[7,28,146],"deeper":[8],"memory":[9],"hierarchies,":[10],"increasing":[11],"the":[12,46,76,79,86,107,140,143,148],"importance":[13],"of":[14,37,45,75,78,88,109,136,142,151],"loop":[15,71,89],"transformations":[16,38,113],"in":[17,114,139,147],"optimizing":[18],"compilers.":[19],"Because":[20],"compiler":[21],"heuristics":[22],"rely":[23],"on":[24,49,85,121],"simplistic":[25],"performance":[26,48],"models,":[27],"because":[29,74],"they":[30,40],"are":[31],"bound":[32],"to":[33,58,105,127],"a":[34,43,55,101,152],"limited":[35],"set":[36],"sequences,":[39],"only":[41],"uncover":[42],"fraction":[44],"peak":[47],"typical":[50],"benchmarks.":[51],"Iterative":[52],"optimization":[53,80,155],"is":[54,119],"maturing":[56],"framework":[57],"address":[59],"these":[60],"limitations,":[61],"but":[62],"so":[63],"far,":[64],"it":[65],"was":[66],"not":[67],"successfully":[68],"applied":[69],"complex":[70],"transformation":[72,90],"sequences":[73],"combinatorics":[77],"search":[81,144],"space.":[82],"We":[83,99],"focus":[84],"class":[87],"which":[91],"can":[92],"be":[93],"expressed":[94],"as":[95,125],"one-dimensional":[96],"affine":[97],"schedules.":[98],"define":[100],"systematic":[102],"exploration":[103],"method":[104,118],"enumerate":[106],"space":[108,145],"all":[110],"legal,":[111],"distinct":[112],"this":[115],"class.":[116],"This":[117],"based":[120],"an":[122],"upstream":[123],"characterization,":[124],"opposed":[126],"state-of-the-art":[128],"downstream":[129],"filtering":[130],"approaches.":[131],"Our":[132],"results":[133],"demonstrate":[134],"orders":[135],"magnitude":[137],"improvements":[138],"size":[141],"convergence":[149],"speed":[150],"dedicated":[153],"iterative":[154],"heuristic":[156]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":11}],"updated_date":"2026-10-29T09:56:32.521200","created_date":"2016-06-24T00:00:00"}