{"id":"https://openalex.org/W2153166874","doi":"https://doi.org/10.1109/icpp.2003.1240630","title":"Code tiling for improving the cache performance of PDE solvers","display_name":"Code tiling for improving the cache performance of PDE solvers","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2153166874","doi":"https://doi.org/10.1109/icpp.2003.1240630","mag":"2153166874"},"language":"en","primary_location":{"id":"doi:10.1109/icpp.2003.1240630","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2003.1240630","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 International Conference on Parallel Processing, 2003. Proceedings.","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/A5032594683","display_name":"Qingguang Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Qingguang Huang","raw_affiliation_strings":["School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024664385","display_name":"Jingling Xue","orcid":"https://orcid.org/0000-0003-0380-3506"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Jingling Xue","raw_affiliation_strings":["School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046613695","display_name":"Xavier Vera","orcid":null},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"X. Vera","raw_affiliation_strings":["Institutionen f\u00f6or Datateknik, M\u00e4alardalens H\u00f6ogskola, Vasteras, Sweden"],"affiliations":[{"raw_affiliation_string":"Institutionen f\u00f6or Datateknik, M\u00e4alardalens H\u00f6ogskola, Vasteras, Sweden","institution_ids":["https://openalex.org/I82509713"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032594683"],"corresponding_institution_ids":["https://openalex.org/I31746571"],"apc_list":null,"apc_paid":null,"fwci":0.2473,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.58171279,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"615","last_page":"624"},"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9965999722480774,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9912999868392944,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/loop-tiling","display_name":"Loop tiling","score":0.9224975109100342},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8181414604187012},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7283776998519897},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6340216994285583},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.587378978729248},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.5089519023895264},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4685298800468445},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.4170885384082794},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.4155426025390625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38479793071746826},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34712398052215576},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12268498539924622},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11963215470314026},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.1166638731956482}],"concepts":[{"id":"https://openalex.org/C11799548","wikidata":"https://www.wikidata.org/wiki/Q6675847","display_name":"Loop tiling","level":3,"score":0.9224975109100342},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8181414604187012},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7283776998519897},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6340216994285583},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.587378978729248},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.5089519023895264},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4685298800468445},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.4170885384082794},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.4155426025390625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38479793071746826},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34712398052215576},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12268498539924622},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11963215470314026},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.1166638731956482},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icpp.2003.1240630","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2003.1240630","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 International Conference on Parallel Processing, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.117.3734","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.3734","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unsw.edu.au/~jingling/papers/icpp03.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.4039","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.4039","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unsw.edu.au/~jxue/papers/icpp03.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W198468299","https://openalex.org/W1502340801","https://openalex.org/W1562841074","https://openalex.org/W1968347730","https://openalex.org/W1972209410","https://openalex.org/W1973122629","https://openalex.org/W1987402220","https://openalex.org/W1997449553","https://openalex.org/W2020214444","https://openalex.org/W2042629708","https://openalex.org/W2078504799","https://openalex.org/W2098406302","https://openalex.org/W2116493917","https://openalex.org/W2119042753","https://openalex.org/W2119609467","https://openalex.org/W2158158791","https://openalex.org/W2161823660","https://openalex.org/W2296218291","https://openalex.org/W3006533007","https://openalex.org/W4243796884","https://openalex.org/W4244282374","https://openalex.org/W4249968602","https://openalex.org/W4388321923","https://openalex.org/W6608073734","https://openalex.org/W6629914007"],"related_works":["https://openalex.org/W2002505081","https://openalex.org/W2083681681","https://openalex.org/W2577630842","https://openalex.org/W1172579163","https://openalex.org/W1488300410","https://openalex.org/W2138790427","https://openalex.org/W3146558274","https://openalex.org/W4246454774","https://openalex.org/W2162051035","https://openalex.org/W1597127505"],"abstract_inverted_index":{"For":[0],"SOR-like":[1],"PDE":[2],"solvers,":[3],"loop":[4,43,79,110],"tiling":[5,25,41,44,53,80,111,114],"either":[6],"helps":[7],"little":[8],"in":[9,54,70],"improving":[10],"data":[11,52,113],"locality":[12],"or":[13],"hurts":[14],"their":[15],"performance.":[16],"We":[17],"present":[18,69],"a":[19,37,46,56,59,98,119,125,152],"novel":[20],"compiler":[21],"technique":[22,83],"called":[23,51],"code":[24],"for":[26,31,143,157],"generating":[27],"fast":[28,145],"tiled":[29,71],"codes":[30,72],"these":[32],"solvers":[33,147],"on":[34,103],"uniprocessors":[35],"with":[36,45],"memory":[38],"hierarchy.":[39],"Code":[40],"combines":[42],"new":[47],"array":[48],"layout":[49],"transformation":[50],"such":[55],"way":[57],"that":[58,65,123],"significant":[60],"amount":[61],"of":[62,91,100,109,131,154],"cache":[63,126],"misses":[64],"would":[66],"otherwise":[67],"be":[68],"are":[73],"eliminated.":[74],"Compared":[75],"to":[76,117,150],"nine":[77],"existing":[78],"algorithms,":[81],"our":[82,140],"delivers":[84],"impressive":[85],"performance":[86,95],"speedups":[87],"(faster":[88],"by":[89],"factors":[90],"1.55-2.62)":[92],"and":[93,112],"smooth":[94],"curves":[96],"across":[97],"range":[99],"problem":[101,133,159],"sizes":[102],"representative":[104],"machine":[105],"architectures.":[106],"The":[107],"synergy":[108],"allows":[115],"us":[116],"find":[118],"problem-size-independent":[120],"tile":[121],"size":[122,134],"minimises":[124],"miss":[127],"objective":[128],"function":[129],"independently":[130],"the":[132],"parameters.":[135],"This":[136],"\"one-size-fits-all\"":[137],"scheme":[138],"makes":[139],"approach":[141],"attractive":[142],"designing":[144],"SOR":[146],"without":[148],"having":[149],"generate":[151],"multitude":[153],"versions":[155],"specialised":[156],"different":[158],"sizes.":[160]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}