{"id":"https://openalex.org/W2003937683","doi":"https://doi.org/10.1145/2254064.2254123","title":"Polyhedra scanning revisited","display_name":"Polyhedra scanning revisited","publication_year":2012,"publication_date":"2012-06-11","ids":{"openalex":"https://openalex.org/W2003937683","doi":"https://doi.org/10.1145/2254064.2254123","mag":"2003937683"},"language":"en","primary_location":{"id":"doi:10.1145/2254064.2254123","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2254064.2254123","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"},"type":"article","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/A5100373367","display_name":"Chun Chen","orcid":"https://orcid.org/0000-0002-6198-7481"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chun Chen","raw_affiliation_strings":["University of Utah, Salt Lake City, UT, USA","University of Utah, Salt Lake City, UT, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Utah, Salt Lake City, UT, USA","institution_ids":["https://openalex.org/I223532165"]},{"raw_affiliation_string":"University of Utah, Salt Lake City, UT, USA#TAB#","institution_ids":["https://openalex.org/I223532165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100373367"],"corresponding_institution_ids":["https://openalex.org/I223532165"],"apc_list":null,"apc_paid":null,"fwci":4.6409,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.95006558,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"499","last_page":"508"},"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.995199978351593,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9915000200271606,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.7840961217880249},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7465349435806274},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.5866259932518005},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5810691118240356},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5748693943023682},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.5708335041999817},{"id":"https://openalex.org/keywords/loop-fusion","display_name":"Loop fusion","score":0.5256196856498718},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5217914581298828},{"id":"https://openalex.org/keywords/polytope-model","display_name":"Polytope model","score":0.48648661375045776},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.46424683928489685},{"id":"https://openalex.org/keywords/for-loop","display_name":"For loop","score":0.4391494691371918},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.425925612449646},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3989970088005066},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3367852568626404},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2983148694038391},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1392691731452942},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12148630619049072},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.11163309216499329}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.7840961217880249},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7465349435806274},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.5866259932518005},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5810691118240356},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5748693943023682},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5708335041999817},{"id":"https://openalex.org/C82653869","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fusion","level":3,"score":0.5256196856498718},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5217914581298828},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.48648661375045776},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.46424683928489685},{"id":"https://openalex.org/C2779624466","wikidata":"https://www.wikidata.org/wiki/Q838119","display_name":"For loop","level":3,"score":0.4391494691371918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.425925612449646},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3989970088005066},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3367852568626404},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2983148694038391},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1392691731452942},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12148630619049072},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.11163309216499329},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2254064.2254123","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2254064.2254123","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation","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":29,"referenced_works":["https://openalex.org/W1486289306","https://openalex.org/W1491410022","https://openalex.org/W1533186609","https://openalex.org/W1547909858","https://openalex.org/W1558370006","https://openalex.org/W1567153395","https://openalex.org/W1595858234","https://openalex.org/W1776224102","https://openalex.org/W1779740778","https://openalex.org/W1960837911","https://openalex.org/W1968124998","https://openalex.org/W1978762859","https://openalex.org/W1995270665","https://openalex.org/W2011771274","https://openalex.org/W2030859425","https://openalex.org/W2041294870","https://openalex.org/W2057043354","https://openalex.org/W2067913710","https://openalex.org/W2071110673","https://openalex.org/W2099758780","https://openalex.org/W2100664615","https://openalex.org/W2115089829","https://openalex.org/W2119609467","https://openalex.org/W2132331020","https://openalex.org/W2152506070","https://openalex.org/W2158626113","https://openalex.org/W2268696613","https://openalex.org/W3203568064","https://openalex.org/W6637804602"],"related_works":["https://openalex.org/W2080027614","https://openalex.org/W2114948246","https://openalex.org/W4254171597","https://openalex.org/W2159360349","https://openalex.org/W2052992886","https://openalex.org/W2342605656","https://openalex.org/W1596526459","https://openalex.org/W2001294731","https://openalex.org/W154155438","https://openalex.org/W2017719803"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,40],"new":[4,37],"polyhedra":[5,102],"scanning":[6,103],"system":[7],"called":[8],"CodeGen+":[9,87,113],"to":[10,88,121],"address":[11],"the":[12,69,74,80,100],"challenge":[13],"of":[14,31,48,71,83],"generating":[15],"high-performance":[16],"code":[17,54,115],"for":[18],"complex":[19,90],"iteration":[20,95],"spaces":[21],"resulting":[22],"from":[23],"compiler":[24],"optimization":[25,91],"and":[26,53,119],"autotuning":[27],"systems.":[28],"The":[29],"strength":[30],"our":[32],"approach":[33],"lies":[34],"in":[35,73,94],"two":[36],"algorithms.":[38],"First,":[39],"loop":[41,51,59,108],"overhead":[42,52],"removal":[43],"algorithm":[44,66],"provides":[45],"precise":[46],"control":[47],"trade-offs":[49],"between":[50],"size":[55],"based":[56],"on":[57,106],"actual":[58],"nesting":[60],"depth.":[61],"Second,":[62],"an":[63],"if-statement":[64],"simplification":[65],"further":[67],"reduces":[68],"number":[70],"comparisons":[72],"code.":[75],"These":[76],"algorithms":[77],"combined":[78],"with":[79,99],"expressive":[81],"power":[82],"Presburger":[84],"arithmetic":[85],"enable":[86],"support":[89],"strategies":[92],"expressed":[93],"spaces.":[96],"We":[97],"compare":[98],"state-of-the-art":[101],"tool":[104],"CLooG":[105],"five":[107],"nest":[109],"computations,":[110],"demonstrating":[111],"that":[112,116],"generates":[114],"is":[117],"simpler":[118],"up":[120],"1.15x":[122],"faster.":[123]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}