{"id":"https://openalex.org/W1967414258","doi":"https://doi.org/10.1145/2160910.2160912","title":"Parameterized loop tiling","display_name":"Parameterized loop tiling","publication_year":2012,"publication_date":"2012-04-01","ids":{"openalex":"https://openalex.org/W1967414258","doi":"https://doi.org/10.1145/2160910.2160912","mag":"1967414258"},"language":"en","primary_location":{"id":"doi:10.1145/2160910.2160912","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2160910.2160912","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2160910.2160912","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2160910.2160912","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/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lakshminarayanan Renganarayanan","raw_affiliation_strings":["IBM T.J. Watson Research Center, Yorktown Heights, NY","IBM -- T. J. Watson Research Center, Yorktown Heights, NY"],"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, Yorktown Heights, NY","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM -- T. J. Watson Research Center, Yorktown Heights, NY","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063521532","display_name":"DaeGon Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daegon Kim","raw_affiliation_strings":["CORESPEQ, Inc., Milpitas, CA"],"affiliations":[{"raw_affiliation_string":"CORESPEQ, Inc., Milpitas, CA","institution_ids":[]}]},{"author_position":"middle","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","Colorado State University, Fort Collins, CO;"],"affiliations":[{"raw_affiliation_string":"Colorado State University, Fort Collins, CO","institution_ids":["https://openalex.org/I92446798"]},{"raw_affiliation_string":"Colorado State University, Fort Collins, CO;","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"last","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","Colorado State University, Fort Collins, CO;"],"affiliations":[{"raw_affiliation_string":"Colorado State University, Fort Collins, CO","institution_ids":["https://openalex.org/I92446798"]},{"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/I4210114115"],"apc_list":null,"apc_paid":null,"fwci":2.4217114,"has_fulltext":true,"cited_by_count":33,"citation_normalized_percentile":{"value":0.89495837,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"34","issue":"1","first_page":"1","last_page":"41"},"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.9998999834060669,"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.9998999834060669,"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.9932000041007996,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9896000027656555,"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/computer-science","display_name":"Computer science","score":0.8373568654060364},{"id":"https://openalex.org/keywords/loop-tiling","display_name":"Loop tiling","score":0.781246542930603},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7751016616821289},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.6672048568725586},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6184280514717102},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5877561569213867},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4676363468170166},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.46453171968460083},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.4580667316913605},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44483891129493713},{"id":"https://openalex.org/keywords/partial-evaluation","display_name":"Partial evaluation","score":0.43003398180007935},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.33786439895629883},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27266165614128113},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14435991644859314},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1313161849975586}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8373568654060364},{"id":"https://openalex.org/C11799548","wikidata":"https://www.wikidata.org/wiki/Q6675847","display_name":"Loop tiling","level":3,"score":0.781246542930603},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7751016616821289},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.6672048568725586},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6184280514717102},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5877561569213867},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4676363468170166},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.46453171968460083},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.4580667316913605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44483891129493713},{"id":"https://openalex.org/C195701839","wikidata":"https://www.wikidata.org/wiki/Q4008398","display_name":"Partial evaluation","level":2,"score":0.43003398180007935},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.33786439895629883},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27266165614128113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14435991644859314},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1313161849975586},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2160910.2160912","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2160910.2160912","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2160910.2160912","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/2160910.2160912","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2160910.2160912","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2160910.2160912","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1967414258.pdf","grobid_xml":"https://content.openalex.org/works/W1967414258.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W1484385067","https://openalex.org/W1503700136","https://openalex.org/W1513554765","https://openalex.org/W1533186609","https://openalex.org/W1538812621","https://openalex.org/W1565751843","https://openalex.org/W1600937464","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/W2081771167","https://openalex.org/W2100664615","https://openalex.org/W2104445255","https://openalex.org/W2107715790","https://openalex.org/W2112391112","https://openalex.org/W2119609467","https://openalex.org/W2119691711","https://openalex.org/W2126464777","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/W2318318384","https://openalex.org/W2914907802","https://openalex.org/W3203568064","https://openalex.org/W4237357168","https://openalex.org/W6630017606","https://openalex.org/W6630903078"],"related_works":["https://openalex.org/W1853049011","https://openalex.org/W2069811640","https://openalex.org/W1547259518","https://openalex.org/W2384576618","https://openalex.org/W2347401507","https://openalex.org/W2158819012","https://openalex.org/W2374073571","https://openalex.org/W2389852039","https://openalex.org/W1602521801","https://openalex.org/W1971094968"],"abstract_inverted_index":{"Loop":[0],"tiling":[1,227,269],"is":[2,45,155],"a":[3,107,118,150,222,238,247,263,274],"widely":[4],"used":[5],"program":[6],"optimization":[7],"that":[8,36,135,154],"improves":[9],"data":[10],"locality":[11],"and":[12,34,41,102,140,186,243,273],"enables":[13],"coarse-grained":[14],"parallelism.":[15],"Parameterized":[16],"tiled":[17,56,75,87,113,131,178,251,280],"loops,":[18,145],"where":[19],"the":[20,72,79,111,122,127,146,170,204,209,255],"tile":[21,166],"sizes":[22],"remain":[23],"symbolic":[24],"parameters":[25],"until":[26],"runtime,":[27],"are":[28],"quite":[29],"useful":[30],"for":[31,51,78,164,198,216,240,249],"iterative":[32],"compilers":[33],"autotuners":[35],"produce":[37],"highly":[38],"optimized":[39],"libraries":[40],"codes.":[42],"Although":[43],"it":[44,195],"easy":[46],"to":[47,134,157],"generate":[48],"such":[49],"loops":[50,139,252],"(hyper-)":[52,58,89],"rectangular":[53,59,90],"iteration":[54,84],"spaces":[55,85],"with":[57,95,100,175],"tiles,":[60],"many":[61],"important":[62],"computations":[63],"do":[64],"not":[65],"fall":[66],"into":[67],"this":[68,214],"restricted":[69],"domain.":[70],"In":[71],"past,":[73],"parameterized":[74,112,130,226,267,279],"code":[76,132,151,159],"generation":[77,115,133,152,160,180,282],"general":[80],"case":[81],"of":[82,110,129,136,143,172,191,225,228,260,266],"convex":[83],"being":[86],"by":[88,232],"tiles":[91],"has":[92],"been":[93],"solved":[94],"bounding":[96],"box":[97],"approaches":[98],"or":[99],"sophisticated":[101],"expensive":[103],"machinery.":[104],"We":[105,168,219],"present":[106],"novel":[108],"formulation":[109],"loop":[114,179,230,268,281],"problem":[116,128],"using":[117,270],"polyhedral":[119],"set":[120],"called":[121],"outset":[123,147],".":[124],"By":[125],"reducing":[126],"generating":[137,250],"standard":[138],"simple":[141],"postprocessing":[142],"these":[144],"method":[148],"achieves":[149],"efficiency":[153],"comparable":[156],"existing":[158],"techniques,":[161],"including":[162],"those":[163],"fixed":[165],"sizes.":[167],"compare":[169],"performance":[171],"our":[173,192],"technique":[174,211],"several":[176],"other":[177],"methods":[181],"on":[182],"kernels":[183],"from":[184,254],"BLAS3":[185],"scientific":[187],"computations.":[188],"The":[189],"simplicity":[190],"solution":[193],"makes":[194],"well":[196],"suited":[197],"use":[199],"in":[200,213],"production":[201],"compilers\u2014in":[202],"particular,":[203],"IBM":[205],"XL":[206],"compiler":[207],"uses":[208],"inset-based":[210],"introduced":[212],"article":[215],"register":[217],"tiling.":[218],"also":[220],"provide":[221],"complete":[223],"coverage":[224],"perfect":[229],"nests":[231],"describing":[233],"three":[234],"related":[235],"techniques:":[236],"(i)":[237],"scheme":[239,248],"separating":[241],"full":[242],"partial":[244],"tiles;":[245],"(ii)":[246],"directly":[253],"abstract":[256],"syntax":[257],"tree":[258],"representation":[259],"loops;":[261],"(iii)":[262],"formal":[264],"characterization":[265],"bilinear":[271],"forms":[272],"Symbolic":[275],"Fourier-Motzkin":[276],"Elimination":[277],"(SFME)-based":[278],"method.":[283]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}