{"id":"https://openalex.org/W2158958889","doi":"https://doi.org/10.1145/1250734.1250780","title":"Parameterized tiled loops for free","display_name":"Parameterized tiled loops for free","publication_year":2007,"publication_date":"2007-06-10","ids":{"openalex":"https://openalex.org/W2158958889","doi":"https://doi.org/10.1145/1250734.1250780","mag":"2158958889"},"language":"en","primary_location":{"id":"doi:10.1145/1250734.1250780","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250734.1250780","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th 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/A5071073556","display_name":"Lakshminarayanan Renganarayanan","orcid":null},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lakshminarayanan Renganarayanan","raw_affiliation_strings":["Colorado State University, Fort Collins, CO"],"affiliations":[{"raw_affiliation_string":"Colorado State University, Fort Collins, CO","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063521532","display_name":"DaeGon Kim","orcid":null},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DaeGon Kim","raw_affiliation_strings":["Colorado State University, Fort Collins, CO"],"affiliations":[{"raw_affiliation_string":"Colorado State University, Fort Collins, CO","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047953886","display_name":"Sanjay Rajopadhye","orcid":"https://orcid.org/0000-0002-4246-6066"},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjay Rajopadhye","raw_affiliation_strings":["Colorado State University, Fort Collins, CO"],"affiliations":[{"raw_affiliation_string":"Colorado State University, Fort Collins, CO","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022191670","display_name":"Michelle Mills Strout","orcid":"https://orcid.org/0000-0001-7646-4766"},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michelle Mills Strout","raw_affiliation_strings":["Colorado State University, Fort Collins, CO"],"affiliations":[{"raw_affiliation_string":"Colorado State University, Fort Collins, CO","institution_ids":["https://openalex.org/I92446798"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5071073556"],"corresponding_institution_ids":["https://openalex.org/I92446798"],"apc_list":null,"apc_paid":null,"fwci":5.7287,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.9601952,"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":"405","last_page":"414"},"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.9998000264167786,"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.9998000264167786,"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.9947999715805054,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9897000193595886,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.795746922492981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.784598171710968},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.6816975474357605},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6053110957145691},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5719942450523376},{"id":"https://openalex.org/keywords/tile","display_name":"Tile","score":0.5183118581771851},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5170198678970337},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.4633615016937256},{"id":"https://openalex.org/keywords/partial-evaluation","display_name":"Partial evaluation","score":0.46065613627433777},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44242948293685913},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28338149189949036},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.22541630268096924},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.09441089630126953}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.795746922492981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.784598171710968},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.6816975474357605},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6053110957145691},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5719942450523376},{"id":"https://openalex.org/C2780728851","wikidata":"https://www.wikidata.org/wiki/Q468402","display_name":"Tile","level":2,"score":0.5183118581771851},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5170198678970337},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.4633615016937256},{"id":"https://openalex.org/C195701839","wikidata":"https://www.wikidata.org/wiki/Q4008398","display_name":"Partial evaluation","level":2,"score":0.46065613627433777},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44242948293685913},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28338149189949036},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.22541630268096924},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.09441089630126953},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","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/1250734.1250780","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250734.1250780","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.125.4572","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.4572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucla.edu/~palsberg/course/cs239/F07/papers/renganarayanan.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.9552","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.9552","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.colostate.edu/~mstrout/Papers/Papers05-09/p405-renganarayanan.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W161559651","https://openalex.org/W1484385067","https://openalex.org/W1503700136","https://openalex.org/W1533186609","https://openalex.org/W1538812621","https://openalex.org/W1565751843","https://openalex.org/W1776224102","https://openalex.org/W1966439270","https://openalex.org/W1973359136","https://openalex.org/W1973923211","https://openalex.org/W1995270665","https://openalex.org/W2007194250","https://openalex.org/W2008677874","https://openalex.org/W2038198320","https://openalex.org/W2041929342","https://openalex.org/W2053895556","https://openalex.org/W2062873592","https://openalex.org/W2119609467","https://openalex.org/W2119691711","https://openalex.org/W2129471558","https://openalex.org/W2132331020","https://openalex.org/W2134788617","https://openalex.org/W2135653967","https://openalex.org/W2136952590","https://openalex.org/W2137152633","https://openalex.org/W2158158791","https://openalex.org/W2296218291","https://openalex.org/W2732051504","https://openalex.org/W2914907802","https://openalex.org/W3136479147","https://openalex.org/W3203568064"],"related_works":["https://openalex.org/W2011669306","https://openalex.org/W2157117208","https://openalex.org/W3207712758","https://openalex.org/W2074720405","https://openalex.org/W307712065","https://openalex.org/W2999906275","https://openalex.org/W2003411722","https://openalex.org/W4237382625","https://openalex.org/W2155925023","https://openalex.org/W2036830099"],"abstract_inverted_index":{"Parameterized":[0,75],"tiled":[1,60,88,139,179],"loops-where":[2],"the":[3,80,95,124,160,175],"tile":[4,76,157],"sizes":[5],"are":[6],"not":[7,69,168],"fixed":[8,156],"at":[9],"compile":[10],"time,":[11],"but":[12],"remain":[13],"symbolic":[14,104],"parameters":[15],"until":[16],"later--are":[17],"quite":[18],"useful":[19],"for":[20,55,79,136,155,181,196],"iterative":[21],"compilers":[22],"and":[23,30,118,128,159],"\"auto-tuners\"":[24],"that":[25],"produce":[26],"highly":[27],"optimized":[28],"libraries":[29],"codes.":[31],"Tile":[32],"size":[33],"parameterization":[34],"could":[35],"also":[36],"enable":[37],"optimizations":[38],"such":[39,53],"as":[40,164,189],"register":[41],"tiling":[42],"to":[43,51,147],"become":[44],"dynamic":[45],"optimizations.":[46],"Although":[47],"it":[48],"is":[49,145,163,187],"easy":[50],"generate":[52],"loops":[54,180],"(hyper)":[56,62,90],"rectangular":[57,63,91],"iteration":[58,85],"spaces":[59,86],"with":[61,99],"tiles,":[64],"many":[65],"important":[66],"computations":[67],"do":[68],"fall":[70],"into":[71],"this":[72],"restricted":[73],"domain.":[74],"code":[77,115,120,142,150,162],"generation":[78,116,143,151],"general":[81],"case":[82],"of":[83,131],"convex":[84],"being":[87],"by":[89],"tiles":[92],"has":[93],"in":[94,198],"past":[96],"been":[97],"solved":[98],"bounding":[100],"box":[101],"approaches":[102,110],"or":[103],"Fourier":[105],"Motzkin":[106],"approaches.":[107],"However,":[108],"both":[109],"have":[111],"less":[112],"than":[113],"ideal":[114],"efficiency":[117,144],"resulting":[119,161],"quality.":[121],"We":[122],"present":[123],"theoretical":[125],"foundations,":[126],"implementation,":[127],"experimental":[129],"validation":[130],"a":[132],"simple,":[133],"unified":[134],"technique":[135,176],"generating":[137],"parameterized":[138,178],"code.":[140],"Our":[141,183],"comparable":[146],"all":[148,171],"existing":[149],"techniques":[152],"including":[153],"those":[154],"sizes,":[158],"efficient":[165],"as,":[166],"if":[167],"more":[169],"than,":[170],"previous":[172],"techniques.":[173],"Thus":[174],"provides":[177],"free!":[182],"\"one-size-fits-all\"":[184],"solution,":[185],"which":[186],"available":[188],"open":[190],"source":[191],"software":[192],"can":[193],"be":[194],"adapted":[195],"use":[197],"production":[199],"compilers.":[200]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
