{"id":"https://openalex.org/W1999919277","doi":"https://doi.org/10.1177/1094342009358413","title":"Optimization of a Computational Fluid Dynamics Code for the Memory Hierarchy: A Case Study","display_name":"Optimization of a Computational Fluid Dynamics Code for the Memory Hierarchy: A Case Study","publication_year":2010,"publication_date":"2010-01-11","ids":{"openalex":"https://openalex.org/W1999919277","doi":"https://doi.org/10.1177/1094342009358413","mag":"1999919277"},"language":"en","primary_location":{"id":"doi:10.1177/1094342009358413","is_oa":false,"landing_page_url":"https://doi.org/10.1177/1094342009358413","pdf_url":null,"source":{"id":"https://openalex.org/S60606485","display_name":"The International Journal of High Performance Computing Applications","issn_l":"1094-3420","issn":["1094-3420","1741-2846"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of High Performance Computing Applications","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/A5045530644","display_name":"Thomas H\u00e4user","orcid":"https://orcid.org/0000-0003-1170-6749"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Thomas Hauser","raw_affiliation_strings":["ACADEMIC & RESEARCH TECHNOLOGIES, NORTHWESTERN UNIVERSITY, 1970 CAMPUS DRIVE, EVANSTON, IL, 60208, USA,","ACADEMIC & RESEARCH TECHNOLOGIES, NORTHWESTERN UNIVERSITY,1970 CAMPUS DRIVE, EVANSTON, IL, 60208, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ACADEMIC & RESEARCH TECHNOLOGIES, NORTHWESTERN UNIVERSITY, 1970 CAMPUS DRIVE, EVANSTON, IL, 60208, USA,","institution_ids":[]},{"raw_affiliation_string":"ACADEMIC & RESEARCH TECHNOLOGIES, NORTHWESTERN UNIVERSITY,1970 CAMPUS DRIVE, EVANSTON, IL, 60208, USA#TAB#","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053913983","display_name":"Raymond LeBeau","orcid":null},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raymond LeBeau","raw_affiliation_strings":["PHYSICS AND ASTRONOMY DEPARTMENT, UNIVERSITY OF KENTUCKY, LEXINGTON, KY, USA","PHYSICS AND ASTRONOMY DEPARTMENT, UNIVERSITY OF KENTUCKY,LEXINGTON, KY, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PHYSICS AND ASTRONOMY DEPARTMENT, UNIVERSITY OF KENTUCKY, LEXINGTON, KY, USA","institution_ids":["https://openalex.org/I143302722"]},{"raw_affiliation_string":"PHYSICS AND ASTRONOMY DEPARTMENT, UNIVERSITY OF KENTUCKY,LEXINGTON, KY, USA#TAB#","institution_ids":["https://openalex.org/I143302722"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045530644"],"corresponding_institution_ids":["https://openalex.org/I111979921"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.08516177,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"3","first_page":"299","last_page":"318"},"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.9973000288009644,"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.9973000288009644,"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/T11751","display_name":"Lattice Boltzmann Simulation Studies","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9922000169754028,"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.8268857598304749},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7596766352653503},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6557122468948364},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.561922013759613},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"Memory hierarchy","score":0.5449872612953186},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5421823263168335},{"id":"https://openalex.org/keywords/dead-code","display_name":"Dead code","score":0.4645616114139557},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.45568183064460754},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.42736709117889404},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.3697507977485657},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.27168795466423035},{"id":"https://openalex.org/keywords/redundant-code","display_name":"Redundant code","score":0.144505113363266},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09430137276649475},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09256261587142944}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8268857598304749},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7596766352653503},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6557122468948364},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.561922013759613},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.5449872612953186},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5421823263168335},{"id":"https://openalex.org/C47434764","wikidata":"https://www.wikidata.org/wiki/Q1770035","display_name":"Dead code","level":5,"score":0.4645616114139557},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.45568183064460754},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.42736709117889404},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.3697507977485657},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.27168795466423035},{"id":"https://openalex.org/C151578736","wikidata":"https://www.wikidata.org/wiki/Q1251793","display_name":"Redundant code","level":4,"score":0.144505113363266},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09430137276649475},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09256261587142944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/1094342009358413","is_oa":false,"landing_page_url":"https://doi.org/10.1177/1094342009358413","pdf_url":null,"source":{"id":"https://openalex.org/S60606485","display_name":"The International Journal of High Performance Computing Applications","issn_l":"1094-3420","issn":["1094-3420","1741-2846"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of High Performance Computing Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.4399999976158142,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306101","display_name":"National Aeronautics and Space Administration","ror":"https://ror.org/027ka1x80"},{"id":"https://openalex.org/F4320314483","display_name":"Kentucky Science and Engineering Foundation","ror":null},{"id":"https://openalex.org/F4320338283","display_name":"Office of Experimental Program to Stimulate Competitive Research","ror":"https://ror.org/04k9mqs78"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1515668834","https://openalex.org/W1518555263","https://openalex.org/W1538592187","https://openalex.org/W1555915743","https://openalex.org/W1965351873","https://openalex.org/W1971876223","https://openalex.org/W2017156338","https://openalex.org/W2021253658","https://openalex.org/W2033096236","https://openalex.org/W2035545087","https://openalex.org/W2057013409","https://openalex.org/W2061609243","https://openalex.org/W2081233300","https://openalex.org/W2083979601","https://openalex.org/W2088528340","https://openalex.org/W2091113987","https://openalex.org/W2135653967","https://openalex.org/W2136759568","https://openalex.org/W2139927851","https://openalex.org/W2160631534","https://openalex.org/W2312363945","https://openalex.org/W2314948097","https://openalex.org/W2396007337","https://openalex.org/W2731838813","https://openalex.org/W2788962374"],"related_works":["https://openalex.org/W2001324285","https://openalex.org/W2046128376","https://openalex.org/W4388717692","https://openalex.org/W2475955799","https://openalex.org/W1593732971","https://openalex.org/W1981002423","https://openalex.org/W2147122795","https://openalex.org/W1863436361","https://openalex.org/W2527471267","https://openalex.org/W2792468622"],"abstract_inverted_index":{"With":[0],"the":[1,6,19,71,74,82,109,118,146,150,158,162,192,204,212,221,225,253,261,275,289],"current":[2],"shift":[3],"of":[4,9,17,23,60,73,117,128,149,157,185,191,224,244,260,291],"increasing":[5,18],"computational":[7,24,31,48,92],"power":[8],"a":[10,57,68,89,183,257],"processor":[11,294],"by":[12,201,208,217],"including":[13],"multiple":[14],"cores":[15,270,292],"instead":[16],"clock":[20],"frequency,":[21],"consideration":[22],"efficiency":[25,237,267],"is":[26,36,171,238],"gaining":[27],"increased":[28],"importance":[29],"for":[30,39,98,130,137,220,233],"fluid":[32,49,93],"dynamics":[33,50,94],"codes.":[34],"This":[35,106,278],"especially":[37,239],"critical":[38],"applications":[40],"that":[41,124,141,280],"require":[42],"high":[43],"throughput.":[44],"For":[45],"example,":[46],"applying":[47],"simulations":[51,62],"to":[52,78,112,120,134,166,274,296],"multi-disciplinary":[53],"design":[54,83],"optimization":[55],"requires":[56],"large":[58,79,138],"number":[59,290],"similar":[61],"with":[63,102],"different":[64],"input":[65],"parameters.":[66],"Therefore,":[67],"reduction":[69,80,184],"in":[70,81,173,188],"runtime":[72],"code":[75,95,119,159,228],"can":[76,179],"lead":[77],"process.":[84],"In":[85,250],"our":[86],"case":[87],"study,":[88],"two-dimensional,":[90],"block-structured":[91],"was":[96,230],"optimized":[97,122,222,255,262],"performance":[99,126,155,177,229,283],"on":[100],"machines":[101],"hierarchical":[103],"memory":[104,148,193],"systems.":[105],"paper":[107],"illustrates":[108,279],"techniques":[110],"applied":[111],"transform":[113],"an":[114,121,245],"initial":[115],"version":[116,123,223,259],"yielded":[125],"improvements":[127,178],"10%":[129],"very":[131],"small":[132],"cases":[133,140],"about":[135,202,209,218],"50%":[136],"test":[139],"did":[142],"not":[143],"fit":[144],"into":[145],"cache":[147,186,197,206,282],"target":[151],"processor.":[152],"A":[153],"detailed":[154],"analysis":[156],"starting":[160],"at":[161],"global":[163],"level":[164],"down":[165],"subroutines":[167],"and":[168,211],"data":[169],"structures":[170],"presented":[172],"this":[174,251],"paper.":[175],"The":[176,195,227],"be":[180,285],"explained":[181],"through":[182],"misses":[187,198,207,216],"all":[189],"levels":[190],"hierarchy.":[194],"L1":[196],"were":[199,271],"reduced":[200],"50%,":[203],"L2":[205],"80%":[210],"translation":[213],"lookaside":[214],"buffer":[215],"90%":[219],"code.":[226],"also":[231],"evaluated":[232],"multi-core":[234],"processors,":[235],"where":[236],"important":[240,287],"when":[241],"several":[242],"instances":[243],"application":[246],"are":[247],"running":[248],"simultaneously.":[249],"case,":[252],"most":[254],"version,":[256],"blocked":[258],"code,":[263],"more":[264,269],"effectively":[265],"maintained":[266],"as":[268,288],"activated":[272],"compared":[273],"unblocked":[276],"version.":[277],"optimizing":[281],"may":[284],"increasingly":[286],"per":[293],"continues":[295],"rise.":[297]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-02T06:04:40.494371","created_date":"2025-10-10T00:00:00"}