{"id":"https://openalex.org/W1975964164","doi":"https://doi.org/10.1145/2429069.2429127","title":"Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra","display_name":"Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra","publication_year":2013,"publication_date":"2013-01-22","ids":{"openalex":"https://openalex.org/W1975964164","doi":"https://doi.org/10.1145/2429069.2429127","mag":"1975964164"},"language":"en","primary_location":{"id":"doi:10.1145/2429069.2429127","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2429069.2429127","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-00911888/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075524478","display_name":"Ramakrishna Upadrasta","orcid":"https://orcid.org/0000-0002-5290-3266"},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"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/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ramakrishna Upadrasta","raw_affiliation_strings":["INRIA and LRI, Universit\u00e9 Paris-Sud (11), Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA and LRI, Universit\u00e9 Paris-Sud (11), Paris, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I1326498283","https://openalex.org/I4210144804"]}]},{"author_position":"last","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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Albert Cohen","raw_affiliation_strings":["INRIA and \u00c9cole Normale Sup\u00e9rieure, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA and \u00c9cole Normale Sup\u00e9rieure, Paris, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4346,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.80325563,"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":"483","last_page":"496"},"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.9983999729156494,"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.9983999729156494,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9958000183105469,"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/polyhedron","display_name":"Polyhedron","score":0.9354089498519897},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.670495331287384},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6002828478813171},{"id":"https://openalex.org/keywords/polytope-model","display_name":"Polytope model","score":0.5550666451454163},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5193199515342712},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5104705095291138},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5037993788719177},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.4753177762031555},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4657291769981384},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.45697319507598877},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.4292863607406616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39680272340774536},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2623622417449951},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2517527937889099},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2510264813899994},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21703708171844482}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.9354089498519897},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.670495331287384},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6002828478813171},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.5550666451454163},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5193199515342712},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5104705095291138},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5037993788719177},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.4753177762031555},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4657291769981384},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.45697319507598877},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.4292863607406616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39680272340774536},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2623622417449951},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2517527937889099},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2510264813899994},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21703708171844482},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2429069.2429127","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2429069.2429127","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00911888v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00911888","pdf_url":"https://inria.hal.science/hal-00911888/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":"POPL'13 - 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Jan 2013, Rome, Italy. pp.483-496, ⟨10.1145/2429069.2429127⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00911888v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00911888","pdf_url":"https://inria.hal.science/hal-00911888/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":"POPL'13 - 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Jan 2013, Rome, Italy. pp.483-496, ⟨10.1145/2429069.2429127⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1975964164.pdf","grobid_xml":"https://content.openalex.org/works/W1975964164.grobid-xml"},"referenced_works_count":72,"referenced_works":["https://openalex.org/W77311303","https://openalex.org/W205961229","https://openalex.org/W1509560532","https://openalex.org/W1514857085","https://openalex.org/W1518247129","https://openalex.org/W1535111405","https://openalex.org/W1553142094","https://openalex.org/W1597196612","https://openalex.org/W1598202309","https://openalex.org/W1723902394","https://openalex.org/W1772407568","https://openalex.org/W1823736747","https://openalex.org/W1837593827","https://openalex.org/W1963547452","https://openalex.org/W1964119857","https://openalex.org/W1970141743","https://openalex.org/W1977545325","https://openalex.org/W1991031013","https://openalex.org/W1994293250","https://openalex.org/W2000472767","https://openalex.org/W2019609597","https://openalex.org/W2029165396","https://openalex.org/W2034053794","https://openalex.org/W2034761517","https://openalex.org/W2038543880","https://openalex.org/W2049745956","https://openalex.org/W2055383402","https://openalex.org/W2062873592","https://openalex.org/W2073873127","https://openalex.org/W2079235644","https://openalex.org/W2080333071","https://openalex.org/W2087970026","https://openalex.org/W2090286414","https://openalex.org/W2103156824","https://openalex.org/W2106473597","https://openalex.org/W2127470768","https://openalex.org/W2132331020","https://openalex.org/W2135736783","https://openalex.org/W2139559439","https://openalex.org/W2149546641","https://openalex.org/W2150529683","https://openalex.org/W2151888904","https://openalex.org/W2152506070","https://openalex.org/W2155488254","https://openalex.org/W2157099283","https://openalex.org/W2162593590","https://openalex.org/W2165086189","https://openalex.org/W2169287093","https://openalex.org/W2170736936","https://openalex.org/W2171048544","https://openalex.org/W2227557434","https://openalex.org/W2293095839","https://openalex.org/W2340604309","https://openalex.org/W2556804450","https://openalex.org/W2606963276","https://openalex.org/W2607603487","https://openalex.org/W2796604629","https://openalex.org/W2983923412","https://openalex.org/W3039948875","https://openalex.org/W3100198463","https://openalex.org/W3105031228","https://openalex.org/W3158747708","https://openalex.org/W4231316372","https://openalex.org/W4285719527","https://openalex.org/W4301808069","https://openalex.org/W6604133250","https://openalex.org/W6635671133","https://openalex.org/W6678861937","https://openalex.org/W6736295056","https://openalex.org/W6781618339","https://openalex.org/W6992951189","https://openalex.org/W6996888795"],"related_works":["https://openalex.org/W2027575605","https://openalex.org/W2290025547","https://openalex.org/W2072480381","https://openalex.org/W1501102059","https://openalex.org/W2123065190","https://openalex.org/W3128178508","https://openalex.org/W3012067785","https://openalex.org/W934099117","https://openalex.org/W4280529077","https://openalex.org/W1956734396"],"abstract_inverted_index":{"Polyhedral":[0],"compilation":[1],"has":[2],"been":[3],"successful":[4],"in":[5,108],"the":[6,35,73,88,92,101,134,140],"design":[7],"and":[8,15,21,81,110],"implementation":[9],"of":[10,34,37,87,136],"complex":[11],"loop":[12],"nest":[13],"optimizers":[14],"parallelizing":[16],"compilers.":[17],"The":[18],"algorithmic":[19],"complexity":[20],"scalability":[22],"limitations":[23],"remain":[24],"one":[25],"important":[26],"weakness.":[27],"We":[28,44,71,122],"address":[29],"it":[30],"using":[31,50,77],"sub-polyhedral":[32,47,130],"under-aproximations":[33],"systems":[36],"constraints":[38],"resulting":[39],"from":[40],"affine":[41],"scheduling":[42,48,79],"problems.":[43],"propose":[45],"a":[46,65,85,118],"technique":[49,56],"(Unit-)Two-Variable-Per-Inequality":[51],"or":[52],"(U)TVPI":[53,69],"Polyhedra.":[54],"This":[55],"relies":[57],"on":[58],"simple":[59],"polynomial":[60],"time":[61],"algorithms":[62],"to":[63,105,117],"under-approximate":[64],"general":[66],"polyhedron":[67],"into":[68],"polyhedra.":[70],"modify":[72],"state-of-the-art":[74],"PLuTo":[75],"compiler":[76],"our":[78,129],"technique,":[80],"show":[82],"that":[83,97,125],"for":[84],"majority":[86],"Polybench":[89],"(2.0)":[90],"kernels,":[91],"above":[93],"under-approximations":[94],"yield":[95],"polyhedra":[96],"are":[98],"non-empty.":[99],"Solving":[100],"under-approximated":[102],"system":[103],"leads":[104],"asymptotic":[106],"gains":[107],"complexity,":[109],"shows":[111],"practically":[112],"significant":[113],"improvements":[114],"when":[115,139],"compared":[116],"traditional":[119],"LP":[120],"solver.":[121],"also":[123],"verify":[124],"code":[126,138],"generated":[127],"by":[128],"parallelization":[131],"prototype":[132],"matches":[133],"performance":[135],"PLuTo-optimized":[137],"under-approximation":[141],"preserves":[142],"feasibility.":[143]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}