{"id":"https://openalex.org/W2019557157","doi":"https://doi.org/10.1145/2687414","title":"Optimal Parallelogram Selection for Hierarchical Tiling","display_name":"Optimal Parallelogram Selection for Hierarchical Tiling","publication_year":2015,"publication_date":"2015-01-09","ids":{"openalex":"https://openalex.org/W2019557157","doi":"https://doi.org/10.1145/2687414","mag":"2019557157"},"language":"en","primary_location":{"id":"doi:10.1145/2687414","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2687414","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2687414","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"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 Architecture and Code Optimization","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/2687414","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101851239","display_name":"Xing Zhou","orcid":"https://orcid.org/0000-0001-6358-1621"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xing Zhou","raw_affiliation_strings":["University of Illinois at Urbana-Champaign","University of Illinois at Urbana Champaign"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110864141","display_name":"Mar\u00eda Jes\u00fas Garzar\u00e1n","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mar\u00eda J. Garzar\u00e1n","raw_affiliation_strings":["University of Illinois at Urbana-Champaign","University of Illinois at Urbana Champaign"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109071293","display_name":"David Padua","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David A. Padua","raw_affiliation_strings":["University of Illinois at Urbana-Champaign","University of Illinois at Urbana Champaign"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana Champaign","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101851239"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.323,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.5895287,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"11","issue":"4","first_page":"1","last_page":"23"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9994000196456909,"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/computer-science","display_name":"Computer science","score":0.8656556606292725},{"id":"https://openalex.org/keywords/tile","display_name":"Tile","score":0.8504749536514282},{"id":"https://openalex.org/keywords/loop-tiling","display_name":"Loop tiling","score":0.7704887390136719},{"id":"https://openalex.org/keywords/parallelogram","display_name":"Parallelogram","score":0.73963862657547},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6780796647071838},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.6621919274330139},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6248201727867126},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5160095691680908},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.5074190497398376},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5004923343658447},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32727617025375366},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18616482615470886},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.122160404920578},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08710938692092896}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8656556606292725},{"id":"https://openalex.org/C2780728851","wikidata":"https://www.wikidata.org/wiki/Q468402","display_name":"Tile","level":2,"score":0.8504749536514282},{"id":"https://openalex.org/C11799548","wikidata":"https://www.wikidata.org/wiki/Q6675847","display_name":"Loop tiling","level":3,"score":0.7704887390136719},{"id":"https://openalex.org/C53118041","wikidata":"https://www.wikidata.org/wiki/Q45867","display_name":"Parallelogram","level":3,"score":0.73963862657547},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6780796647071838},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.6621919274330139},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6248201727867126},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5160095691680908},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5074190497398376},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5004923343658447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32727617025375366},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18616482615470886},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.122160404920578},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08710938692092896},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"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/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2687414","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2687414","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2687414","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"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 Architecture and Code Optimization","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/2687414","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2687414","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2687414","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"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 Architecture and Code Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2019557157.pdf","grobid_xml":"https://content.openalex.org/works/W2019557157.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1491410022","https://openalex.org/W1513554765","https://openalex.org/W1825294837","https://openalex.org/W1836484070","https://openalex.org/W1856294528","https://openalex.org/W1964354616","https://openalex.org/W1968347730","https://openalex.org/W1983416598","https://openalex.org/W2035430533","https://openalex.org/W2049241685","https://openalex.org/W2050203172","https://openalex.org/W2063249715","https://openalex.org/W2090011371","https://openalex.org/W2091074029","https://openalex.org/W2094132822","https://openalex.org/W2094268929","https://openalex.org/W2101285930","https://openalex.org/W2110090002","https://openalex.org/W2110301098","https://openalex.org/W2112132809","https://openalex.org/W2112391112","https://openalex.org/W2119609467","https://openalex.org/W2128249697","https://openalex.org/W2135127849","https://openalex.org/W2145813943","https://openalex.org/W2152506070","https://openalex.org/W2158158791","https://openalex.org/W2159360349","https://openalex.org/W2159560337","https://openalex.org/W2168846776","https://openalex.org/W2561675875","https://openalex.org/W3139348098","https://openalex.org/W4229520511"],"related_works":["https://openalex.org/W2112391112","https://openalex.org/W4254171597","https://openalex.org/W2727330431","https://openalex.org/W181286935","https://openalex.org/W1577903309","https://openalex.org/W2342605656","https://openalex.org/W2159360349","https://openalex.org/W1543710109","https://openalex.org/W2281158700","https://openalex.org/W4238596836"],"abstract_inverted_index":{"Loop":[0],"tiling":[1,108,194],"is":[2,56,75,94,109,115],"an":[3],"effective":[4],"optimization":[5],"to":[6,65,98,141,149],"improve":[7],"performance":[8],"of":[9,33,40,52,70,85,95,101,135,146,201],"multiply":[10],"nested":[11],"loops,":[12],"which":[13],"are":[14,27,132],"the":[15,34,38,43,67,71,82,102,130,143,147,150,163,168,183,191],"most":[16,192],"time-consuming":[17],"parts":[18],"in":[19,37,171,180],"many":[20],"programs.":[21],"Most":[22],"massively":[23],"parallel":[24],"systems":[25],"today":[26],"organized":[28],"hierarchically,":[29],"and":[30,42,137],"different":[31],"levels":[32],"hierarchy":[35,148],"differ":[36],"organization":[39,69],"parallelism":[41,100],"memory":[44],"models":[45],"they":[46],"adopt.":[47],"To":[48],"make":[49],"better":[50],"use":[51],"these":[53,86],"machines,":[54],"it":[55,74],"clear":[57,78],"that":[58,160,166,179],"loop":[59,104,107],"nests":[60],"should":[61,80],"be":[62,81],"tiled":[63,103],"hierarchically":[64],"fit":[66],"hierarchical":[68,87,173],"machine;":[72],"however,":[73],"not":[76,113],"so":[77],"what":[79],"exact":[83],"form":[84],"tiles.":[88],"In":[89,121],"particular,":[90],"tile":[91,118,126,144,164],"shape":[92,119,127,145],"selection":[93,128],"critical":[96],"importance":[97],"expose":[99],"nests.":[105],"Although":[106],"a":[110,139,158,172],"well-known":[111],"optimization,":[112],"much":[114],"known":[116],"about":[117],"selection.":[120],"this":[122,154],"article,":[123],"we":[124,156],"study":[125],"when":[129],"shapes":[131,165],"any":[133],"type":[134],"parallelograms":[136],"introduce":[138],"model":[140],"relate":[142],"execution":[151,169],"time.":[152],"Using":[153],"model,":[155],"implement":[157],"system":[159,189],"automatically":[161,185],"finds":[162],"minimize":[167],"time":[170],"system.":[174],"Our":[175],"experimental":[176],"results":[177],"show":[178],"several":[181],"cases,":[182],"tiles":[184],"selected":[186],"by":[187,198],"our":[188],"outperform":[190],"intuitive":[193],"schemes":[195],"usually":[196],"adopted":[197],"programmers":[199],"because":[200],"their":[202],"simplicity.":[203]},"counts_by_year":[{"year":2019,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}