{"id":"https://openalex.org/W2585984727","doi":"https://doi.org/10.1109/bigdata.2016.7840585","title":"Cache-oblivious loops based on a novel space-filling curve","display_name":"Cache-oblivious loops based on a novel space-filling curve","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2585984727","doi":"https://doi.org/10.1109/bigdata.2016.7840585","mag":"2585984727"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata.2016.7840585","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2016.7840585","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5062860517","display_name":"Christian B\u00f6hm","orcid":"https://orcid.org/0000-0002-2237-9969"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Bohm","raw_affiliation_strings":["Ludwig-Maximilians-Universitiit M\u00f6nchen, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ludwig-Maximilians-Universitiit M\u00f6nchen, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018646385","display_name":"Martin Perdacher","orcid":"https://orcid.org/0000-0003-4882-5055"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Martin Perdacher","raw_affiliation_strings":["University of Vienna, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Vienna, Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009516958","display_name":"Claudia Plant","orcid":"https://orcid.org/0000-0001-5274-8123"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Claudia Plant","raw_affiliation_strings":["University of Vienna, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Vienna, Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1941,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.54136605,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"17","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8071213364601135},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.728812038898468},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.703382134437561},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6397318840026855},{"id":"https://openalex.org/keywords/cache-invalidation","display_name":"Cache invalidation","score":0.5893810391426086},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.5258650779724121},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.49563825130462646},{"id":"https://openalex.org/keywords/loop-tiling","display_name":"Loop tiling","score":0.4917478859424591},{"id":"https://openalex.org/keywords/hilbert-curve","display_name":"Hilbert curve","score":0.4802546799182892},{"id":"https://openalex.org/keywords/cache-pollution","display_name":"Cache pollution","score":0.47053131461143494},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.43682026863098145},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41949260234832764},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39959609508514404}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8071213364601135},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.728812038898468},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.703382134437561},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6397318840026855},{"id":"https://openalex.org/C25536678","wikidata":"https://www.wikidata.org/wiki/Q5015977","display_name":"Cache invalidation","level":5,"score":0.5893810391426086},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.5258650779724121},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.49563825130462646},{"id":"https://openalex.org/C11799548","wikidata":"https://www.wikidata.org/wiki/Q6675847","display_name":"Loop tiling","level":3,"score":0.4917478859424591},{"id":"https://openalex.org/C2781142347","wikidata":"https://www.wikidata.org/wiki/Q1366592","display_name":"Hilbert curve","level":2,"score":0.4802546799182892},{"id":"https://openalex.org/C113166858","wikidata":"https://www.wikidata.org/wiki/Q5015981","display_name":"Cache pollution","level":5,"score":0.47053131461143494},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.43682026863098145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41949260234832764},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39959609508514404},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"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.1109/bigdata.2016.7840585","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2016.7840585","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1498436796","https://openalex.org/W1590905517","https://openalex.org/W1731124780","https://openalex.org/W1777336534","https://openalex.org/W2002257715","https://openalex.org/W2019397928","https://openalex.org/W2025442915","https://openalex.org/W2029966641","https://openalex.org/W2057784562","https://openalex.org/W2062354326","https://openalex.org/W2069896270","https://openalex.org/W2086055644","https://openalex.org/W2095875205","https://openalex.org/W2124509324","https://openalex.org/W2168298551","https://openalex.org/W2291179494","https://openalex.org/W4229794581","https://openalex.org/W6629817848","https://openalex.org/W6635158514"],"related_works":["https://openalex.org/W2098406302","https://openalex.org/W2121191383","https://openalex.org/W2538519144","https://openalex.org/W2546991807","https://openalex.org/W1505654810","https://openalex.org/W2129823593","https://openalex.org/W1584415117","https://openalex.org/W2109265242","https://openalex.org/W2076114130","https://openalex.org/W3109982023"],"abstract_inverted_index":{"Modern":[0],"microprocessors":[1],"offer":[2],"a":[3,42,53,110,121,130,133,141,162,189,210,271],"rich":[4],"memory":[5,64],"hierarchy":[6,142],"including":[7],"various":[8,144],"levels":[9],"of":[10,15,132,143,191,234,274],"cache":[11,131],"and":[12,27,38,76,247],"registers.":[13],"Some":[14],"these":[16,95],"memories":[17],"(like":[18],"main":[19],"memory,":[20],"L3":[21],"cache)":[22,35],"are":[23,36],"big":[24],"but":[25,45,104,139],"slow":[26],"shared":[28],"among":[29],"all":[30,203],"cores.":[31],"Others":[32],"(registers,":[33],"L1":[34],"fast":[37],"exclusively":[39],"assigned":[40],"to":[41,93,127,151,181,222],"single":[43],"core":[44],"small.":[46],"Only":[47],"if":[48],"the":[49,63,101,147,172,178,186,232,252,275],"data":[50,60,118,276],"accesses":[51],"have":[52],"high":[54],"locality,":[55],"we":[56,69,176],"can":[57],"avoid":[58],"excessive":[59],"transfers":[61],"between":[62],"hierarchy.":[65],"In":[66],"this":[67],"paper":[68],"consider":[70],"fundamental":[71],"algorithms":[72,153],"like":[73],"matrix":[74],"multiplication":[75],"decomposition":[77],"as":[78,80,242,244],"well":[79],"K-means":[81],"clustering":[82],"typically":[83],"operating":[84],"in":[85,100,105,238],"two":[86],"or":[87,193,269],"three":[88],"nested":[89,261],"loops.":[90],"We":[91,160,254],"propose":[92,161],"traverse":[94],"loops":[96,237,246,262,265],"whenever":[97],"possible":[98],"not":[99,125],"canonical":[102],"order":[103,107,115],"an":[106],"defined":[108],"by":[109,251,270],"space-filling":[111,164],"curve.":[112],"This":[113],"traversal":[114],"dramatically":[116],"improves":[117],"locality":[119],"over":[120],"wide":[122],"granularity":[123],"allowing":[124],"only":[126],"efficiently":[128],"support":[129],"single,":[134],"known":[135],"size":[136,149],"(cache":[137,158],"conscious)":[138],"also":[140],"caches":[145],"where":[146,185],"effective":[148],"available":[150],"our":[152,196,235],"may":[154],"even":[155],"be":[156],"unknown":[157],"oblivious).":[159],"new":[163],"curve":[165],"called":[166],"Fast":[167],"Unrestricted":[168],"(FUR)":[169],"Hilbert":[170],"with":[171,209],"following":[173],"advantages:":[174],"(1)":[175],"overcome":[177],"usual":[179],"limitation":[180],"square-like":[182],"grid":[183],"sizes":[184],"side-length":[187],"is":[188,207],"power":[190],"2":[192],"3.":[194],"Instead,":[195],"approach":[197,230],"allows":[198],"arbitrary":[199],"loop":[200,218],"boundaries":[201],"for":[202,224],"variables.":[204],"(2)":[205],"FUR-Hilbert":[206],"non-recursive":[208,229],"guaranteed":[211],"constant":[212],"worst":[213],"case":[214],"time":[215],"complexity":[216],"per":[217],"iteration":[219],"(in":[220],"contrast":[221],"O(log(grid-size))":[223],"previous":[225],"methods).":[226],"(3)":[227],"Our":[228],"makes":[231],"application":[233],"cache-oblivious":[236,264],"any":[239],"host":[240],"algorithm":[241],"easy":[243],"conventional":[245],"facilitates":[248],"automatic":[249,268],"optimization":[250],"compiler.":[253],"believe":[255],"that":[256],"future":[257],"compilers":[258],"could":[259],"translate":[260],"into":[263],"either":[266],"fully":[267],"user-guided":[272],"analysis":[273],"dependency.":[277]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}