{"id":"https://openalex.org/W1600567712","doi":null,"title":"Improving locality and parallelism in nested loops","display_name":"Improving locality and parallelism in nested loops","alternate_titles":[],"publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W1600567712","mag":"1600567712"},"language":"en","primary_location":{"id":"mag:1600567712","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=171381","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W1600567712"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5005276837","display_name":"Michael E. Wolf","orcid":"https://orcid.org/0000-0001-6385-9128","observed_orcids":["https://orcid.org/0000-0001-6385-9128"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Michael E. Wolf","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-6385-9128","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5005276837"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.3631,"has_fulltext":false,"cited_by_count":161,"citation_normalized_percentile":{"value":0.98203593,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9994999766349792,"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.9994999766349792,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.0,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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-nest-optimization","display_name":"loop nest optimization","score":0.8410000205039978},{"id":"https://openalex.org/keywords/loop-transformation","display_name":"loop transformation","score":0.8050000071525574},{"id":"https://openalex.org/keywords/loop-interchange","display_name":"loop interchange","score":0.5809999704360962},{"id":"https://openalex.org/keywords/loop-tiling","display_name":"loop tiling","score":0.9419999718666077},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"memory hierarchy","score":0.5559999942779541},{"id":"https://openalex.org/keywords/locality","display_name":"locality","score":0.49300000071525574},{"id":"https://openalex.org/keywords/parallelism","display_name":"parallelism","score":0.9110000133514404},{"id":"https://openalex.org/keywords/compiler-optimization","display_name":"compiler optimization","score":0.5870000123977661},{"id":"https://openalex.org/keywords/tile-size","display_name":"tile size","score":0.7149999737739563},{"id":"https://openalex.org/keywords/cache-associativity","display_name":"cache associativity","score":0.6320000290870667}],"concepts":[{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.8015498518943787},{"id":"https://openalex.org/C134718785","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fission","level":3,"score":0.7877902984619141},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7826600670814514},{"id":"https://openalex.org/C11799548","wikidata":"https://www.wikidata.org/wiki/Q6675847","display_name":"Loop tiling","level":3,"score":0.7660922408103943},{"id":"https://openalex.org/C82653869","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fusion","level":3,"score":0.6992223262786865},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.6207289099693298},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5267735719680786},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.4749608039855957},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.46549972891807556},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.45518678426742554},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44644805788993835},{"id":"https://openalex.org/C3543717","wikidata":"https://www.wikidata.org/wiki/Q6007302","display_name":"Implicit parallelism","level":4,"score":0.41551920771598816},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.3534591794013977},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.3328191041946411},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19402337074279785},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"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":1,"locations":[{"id":"mag:1600567712","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=171381","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4238109388","https://openalex.org/W1532159642","https://openalex.org/W2050529863","https://openalex.org/W7100765409","https://openalex.org/W1499310738","https://openalex.org/W2788464413","https://openalex.org/W2046351222","https://openalex.org/W7096338421","https://openalex.org/W1998529138","https://openalex.org/W7096435980"],"abstract_inverted_index":{"Researchers":[0,26],"have":[1,27,45,66,136,176,260,282,294],"identified":[2],"a":[3,61,76,94,152,206,211,297],"core":[4],"set":[5,314],"of":[6,56,83,97,115,140,147,155,192,203,263,300],"program":[7],"transformations":[8,19,30,57],"that":[9,58,89,248],"are":[10,121,245],"effective":[11],"in":[12,48,266],"array-based":[13],"loop":[14,18,62,73,84,98,134,156,194,207,232],"nest":[15,74,85],"optimization:":[16],"these":[17,29,264],"include":[20],"interchange,":[21],"skewing,":[22],"reversal":[23],"and":[24,35,39,119,190,224,241,250,270,277],"tiling.":[25],"studied":[28],"individually":[31],"for":[32,180,305],"their":[33,124],"legality":[34],"effect":[36],"on":[37,273,302,308],"parallelism":[38,191,204,251],"memory":[40,116,187],"hierarchy":[41,117,188],"performance;":[42],"but":[43,87,123],"they":[44,70],"not":[46,127],"discussed":[47],"any":[49],"detail":[50],"how":[51],"to":[52,93,130,132,163,168,183,185,234,287],"choose":[53],"the":[54,113,138,141,145,181,201,221,236,274,278],"combination":[55],"best":[59],"optimizes":[60],"nest.":[63],"Other":[64],"researchers":[65],"taken":[67],"another":[68],"approach:":[69],"consider":[71],"each":[72],"as":[75,106],"whole,":[77],"applying":[78],"an":[79,165],"elegant":[80],"matrix":[81,142],"theory":[82,143,154,159],"transformation,":[86],"one":[88],"is":[90],"only":[91],"applicable":[92],"limited":[95,111],"class":[96],"nests,":[99,233],"those":[100],"whose":[101],"dependences":[102],"can":[103,252],"be":[104,253],"expressed":[105],"distance":[107],"vectors.":[108],"In":[109],"this":[110,173],"context,":[112],"problems":[114],"improvement":[118,243,286],"parallelization":[120,197,240],"simplified,":[122],"approach":[125,167],"has":[126,160],"been":[128],"extended":[129],"apply":[131,164],"general":[133,148,193],"nests.\r\nWe":[135],"combined":[137],"elegance":[139],"with":[144,310],"generality":[146],"dependence":[149],"vectors":[150],"into":[151],"new":[153],"transformation.":[157],"This":[158],"enabled":[161],"us":[162],"algorithmic":[166],"solving":[169],"optimization":[170],"goals.":[171],"Using":[172],"theory,":[174,223],"we":[175],"developed":[177],"efficient":[178],"algorithms":[179,244,265],"compiler":[182,269,284],"use":[184],"improve":[186,289],"utilization":[189],"nests.":[195],"The":[196,216,239],"improving":[198,218],"algorithm":[199,219],"maximizes":[200],"degree":[202],"within":[205,231],"nest,":[208],"at":[209],"either":[210],"coarse":[212],"or":[213,312],"fine":[214],"granularity.":[215],"locality":[217,242,249,285],"uses":[220],"same":[222],"also":[225,295],"reuse":[226],"information":[227],"about":[228],"array":[229],"accesses":[230],"guide":[235],"transformation":[237],"process.":[238],"unified":[246],"so":[247],"improved":[254],"simultaneously":[255],"without":[256],"significantly":[257,288],"reducing":[258],"either.\r\nWe":[259],"implemented":[261],"versions":[262],"Stanford's":[267],"SUIF":[268],"performed":[271],"experimentation":[272],"Perfect":[275],"Club":[276],"NASA":[279],"kernels.":[280],"We":[281,293],"found":[283],"performance":[290,301],"when":[291],"applicable.":[292],"demonstrated":[296],"tremendous":[298],"sensitivity":[299],"tile":[303],"size":[304],"tiled":[306],"codes":[307],"machines":[309],"direct-mapped":[311],"low":[313],"associativity":[315],"caches.":[316]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1600567712","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":8}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
