{"id":"https://openalex.org/W2065574728","doi":"https://doi.org/10.1142/s0129054103001583","title":"CACHE MISS ANALYSIS OF 2D STENCIL CODES WITH TILED TIME LOOP","display_name":"CACHE MISS ANALYSIS OF 2D STENCIL CODES WITH TILED TIME LOOP","publication_year":2003,"publication_date":"2003-02-01","ids":{"openalex":"https://openalex.org/W2065574728","doi":"https://doi.org/10.1142/s0129054103001583","mag":"2065574728"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054103001583","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103001583","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-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/A5019471239","display_name":"Claudia Leopold","orcid":"https://orcid.org/0000-0003-3256-716X"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"CLAUDIA LEOPOLD","raw_affiliation_strings":["Justus-Liebig-Universit\u00e4t Gie\u00dfen, Institut f\u00fcr Informatik, Arndtstr. 2, 35392 Gie\u00dfen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Justus-Liebig-Universit\u00e4t Gie\u00dfen, Institut f\u00fcr Informatik, Arndtstr. 2, 35392 Gie\u00dfen, Germany","institution_ids":["https://openalex.org/I200763008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019471239"],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.16201752,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":"01","first_page":"39","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9921000003814697,"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"}},"topics":[{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9921000003814697,"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/T12029","display_name":"DNA and Biological Computing","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9812999963760376,"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/speedup","display_name":"Speedup","score":0.775998592376709},{"id":"https://openalex.org/keywords/stencil","display_name":"Stencil","score":0.7552667856216431},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7523010969161987},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6714943051338196},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6190467476844788},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.48557087779045105},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46829620003700256},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.44507724046707153},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3751581907272339},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3226377069950104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19836759567260742},{"id":"https://openalex.org/keywords/computational-science","display_name":"Computational science","score":0.19591161608695984},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11418452858924866}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.775998592376709},{"id":"https://openalex.org/C76752949","wikidata":"https://www.wikidata.org/wiki/Q7607499","display_name":"Stencil","level":2,"score":0.7552667856216431},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7523010969161987},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6714943051338196},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6190467476844788},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.48557087779045105},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46829620003700256},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.44507724046707153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3751581907272339},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3226377069950104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19836759567260742},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.19591161608695984},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11418452858924866},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054103001583","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103001583","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1512166633","https://openalex.org/W2038142281","https://openalex.org/W2075136957","https://openalex.org/W4249066449"],"related_works":["https://openalex.org/W3105129168","https://openalex.org/W2804920739","https://openalex.org/W4316371992","https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2186216222","https://openalex.org/W2392765154","https://openalex.org/W2564509292","https://openalex.org/W2008005532","https://openalex.org/W98480971"],"abstract_inverted_index":{"Stencil":[0],"codes":[1,27],"such":[2],"as":[3],"the":[4,13,49,60,69,89,105],"Jacobi,":[5],"Gau\u00df-Seidel,":[6],"and":[7,20,36,56,73,83],"red-black":[8],"Gau\u00df-Seidel":[9],"kernels":[10],"are":[11],"among":[12],"most":[14,97],"time-consuming":[15],"routines":[16],"in":[17,48,59],"many":[18],"scientific":[19],"engineering":[21],"applications.":[22],"The":[23],"performance":[24],"of":[25,34,71,95],"these":[26],"critically":[28],"depends":[29],"on":[30,68],"an":[31,54],"efficient":[32],"usage":[33],"caches,":[35],"can":[37,108],"be":[38,109],"improved":[39],"by":[40,92,111],"tiling.":[41],"Several":[42],"tiling":[43,81],"schemes":[44],"have":[45],"been":[46],"suggested":[47],"literature;":[50],"this":[51],"paper":[52],"gives":[53],"overview":[55],"comparison.":[57],"Then,":[58],"main":[61],"part,":[62],"we":[63,77],"prove":[64],"a":[65,79,93],"lower":[66,90],"bound":[67,91],"number":[70],"cold":[72],"capacity":[74],"misses.":[75],"Finally,":[76],"analyze":[78],"particular":[80],"scheme,":[82],"show":[84,101],"that":[85,107],"it":[86],"is":[87],"off":[88],"factor":[94],"at":[96],"ten.":[98],"Our":[99],"results":[100],"up":[102],"limitations":[103],"to":[104],"speedup":[106],"gained":[110],"future":[112],"research.":[113]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}