{"id":"https://openalex.org/W2799446878","doi":"https://doi.org/10.1109/tbdata.2018.2830378","title":"A Novel Hilbert Curve for Cache-Locality Preserving Loops","display_name":"A Novel Hilbert Curve for Cache-Locality Preserving Loops","publication_year":2018,"publication_date":"2018-05-04","ids":{"openalex":"https://openalex.org/W2799446878","doi":"https://doi.org/10.1109/tbdata.2018.2830378","mag":"2799446878"},"language":"en","primary_location":{"id":"doi:10.1109/tbdata.2018.2830378","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tbdata.2018.2830378","pdf_url":null,"source":{"id":"https://openalex.org/S2491400915","display_name":"IEEE Transactions on Big Data","issn_l":"2332-7790","issn":["2332-7790","2372-2096"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Big Data","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/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-Universit\u00e4t M\u00fcnchen, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, 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":"https://orcid.org/0000-0003-4882-5055","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":"https://orcid.org/0000-0001-5274-8123","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":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":2.9335,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.92534759,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"7","issue":"2","first_page":"241","last_page":"254"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983999729156494,"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/computer-science","display_name":"Computer science","score":0.8291116952896118},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6933614015579224},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6218598484992981},{"id":"https://openalex.org/keywords/cache-invalidation","display_name":"Cache invalidation","score":0.6136773228645325},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.5868746042251587},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.5467523336410522},{"id":"https://openalex.org/keywords/hilbert-curve","display_name":"Hilbert curve","score":0.4608108699321747},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.4579128623008728},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.45618075132369995},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4439201056957245},{"id":"https://openalex.org/keywords/loop-tiling","display_name":"Loop tiling","score":0.4117498993873596},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37766531109809875}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8291116952896118},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6933614015579224},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6218598484992981},{"id":"https://openalex.org/C25536678","wikidata":"https://www.wikidata.org/wiki/Q5015977","display_name":"Cache invalidation","level":5,"score":0.6136773228645325},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.5868746042251587},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.5467523336410522},{"id":"https://openalex.org/C2781142347","wikidata":"https://www.wikidata.org/wiki/Q1366592","display_name":"Hilbert curve","level":2,"score":0.4608108699321747},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.4579128623008728},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.45618075132369995},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4439201056957245},{"id":"https://openalex.org/C11799548","wikidata":"https://www.wikidata.org/wiki/Q6675847","display_name":"Loop tiling","level":3,"score":0.4117498993873596},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37766531109809875},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"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/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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tbdata.2018.2830378","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tbdata.2018.2830378","pdf_url":null,"source":{"id":"https://openalex.org/S2491400915","display_name":"IEEE Transactions on Big Data","issn_l":"2332-7790","issn":["2332-7790","2372-2096"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Big Data","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.9100000262260437,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1498436796","https://openalex.org/W1590905517","https://openalex.org/W1731124780","https://openalex.org/W1777336534","https://openalex.org/W1963842538","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/W2104734478","https://openalex.org/W2124480634","https://openalex.org/W2124509324","https://openalex.org/W2168298551","https://openalex.org/W2291179494","https://openalex.org/W2408635465","https://openalex.org/W2585984727","https://openalex.org/W2623034713","https://openalex.org/W4206163925","https://openalex.org/W4229666556","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/W2373751233","https://openalex.org/W2538519144","https://openalex.org/W3109982023","https://openalex.org/W2076114130","https://openalex.org/W2109265242","https://openalex.org/W2408534334","https://openalex.org/W1505654810","https://openalex.org/W1967490696"],"abstract_inverted_index":{"Modern":[0],"microprocessors":[1],"offer":[2],"a":[3,42,53,115,126,135,138,146,167,194,215,316],"rich":[4],"memory":[5,64],"hierarchy":[6,147],"including":[7],"various":[8,149],"levels":[9],"of":[10,15,137,148,196,239,296,319],"cache":[11,136,288],"and":[12,27,38,86,252,275,290],"registers.":[13],"Some":[14],"these":[16,100],"memories":[17],"(like":[18],"main":[19],"memory,":[20],"L3":[21],"cache)":[22,35],"are":[23,36],"big":[24],"but":[25,45,109,144],"slow":[26],"shared":[28],"among":[29],"all":[30,208],"cores.":[31],"Others":[32],"(registers,":[33],"L1":[34],"fast":[37],"exclusively":[39],"assigned":[40],"to":[41,98,132,156,186,227],"single":[43],"core":[44],"small.":[46],"Only":[47],"if":[48],"the":[49,63,82,106,152,177,183,191,237,257,271,294,320],"data":[50,60,123,321],"accesses":[51],"have":[52],"high":[54],"locality,":[55],"we":[56,69,181],"can":[57,278],"avoid":[58],"excessive":[59],"transfers":[61],"between":[62],"hierarchy.":[65],"In":[66],"this":[67],"paper":[68],"consider":[70],"fundamental":[71],"algorithms":[72,158,264],"like":[73,265],"matrix":[74],"multiplication,":[75],"K-Means,":[76],"Cholesky":[77,266],"decomposition":[78,267],"as":[79,81,247,249,268,270],"well":[80,269],"algorithm":[83,246,272],"by":[84,114,256,273,277,315],"Floyd":[85,274],"Warshall":[87,276],"typically":[88],"operating":[89],"in":[90,105,110,243],"two":[91],"or":[92,198,314],"three":[93],"nested":[94,306],"loops.":[95],"We":[96,165,260,299],"propose":[97,166],"traverse":[99],"loops":[101,242,251,307,310],"whenever":[102],"possible":[103],"not":[104,130],"canonical":[107],"order":[108,112,120],"an":[111],"defined":[113],"space-filling":[116,169],"curve.":[117],"This":[118],"traversal":[119],"dramatically":[121],"improves":[122],"locality":[124],"over":[125],"wide":[127],"granularity":[128],"allowing":[129],"only":[131],"efficiently":[133,280],"support":[134],"single,":[139],"known":[140],"size":[141,154],"(cache":[142,163],"conscious)":[143],"also":[145],"caches":[150],"where":[151,190],"effective":[153],"available":[155],"our":[157,201,240,297],"may":[159],"even":[160],"be":[161,279],"unknown":[162],"oblivious).":[164],"new":[168],"curve":[170],"called":[171],"Fast":[172],"Unrestricted":[173],"(FUR)":[174],"Hilbert":[175],"with":[176,214],"following":[178],"advantages:":[179],"(1)":[180],"overcome":[182],"usual":[184],"limitation":[185],"square-like":[187],"grid":[188],"sizes":[189],"side-length":[192],"is":[193,212],"power":[195],"2":[197],"3.":[199],"Instead,":[200],"approach":[202,235],"allows":[203],"arbitrary":[204],"loop":[205,223],"boundaries":[206],"for":[207,229],"variables.":[209],"(2)":[210],"FUR-Hilbert":[211],"non-recursive":[213,234],"guaranteed":[216],"constant":[217],"worst":[218],"case":[219],"time":[220],"complexity":[221],"per":[222],"iteration":[224],"(in":[225],"contrast":[226],"O(log(grid-size))":[228],"previous":[230],"methods).":[231],"(3)":[232],"Our":[233],"makes":[236],"application":[238],"cache-oblivious":[241,309],"any":[244],"host":[245],"easy":[248],"conventional":[250],"facilitates":[253],"automatic":[254,313],"optimization":[255],"compiler.":[258],"(4)":[259],"demonstrate":[261,293],"that":[262,301],"crucial":[263],"supported.":[281],"(5)":[282],"Extensive":[283],"experiments":[284],"on":[285],"runtime":[286],"efficiency,":[287],"usage":[289],"energy":[291],"consumption":[292],"profit":[295],"approach.":[298],"believe":[300],"future":[302],"compilers":[303],"could":[304],"translate":[305],"into":[308],"either":[311],"fully":[312],"user-guided":[317],"analysis":[318],"dependency.":[322]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}