{"id":"https://openalex.org/W2207535012","doi":"https://doi.org/10.1145/2776825","title":"Cache efficient functional algorithms","display_name":"Cache efficient functional algorithms","publication_year":2015,"publication_date":"2015-06-25","ids":{"openalex":"https://openalex.org/W2207535012","doi":"https://doi.org/10.1145/2776825","mag":"2207535012"},"language":"en","primary_location":{"id":"doi:10.1145/2776825","doi":"https://doi.org/10.1145/2776825","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2776825","pdf_url":null,"source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","fnege-3","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187","observed_orcids":["https://orcid.org/0000-0003-0224-9187"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028720578","display_name":"Robert W. Harper","orcid":"https://orcid.org/0000-0002-9400-2941","observed_orcids":["https://orcid.org/0000-0002-9400-2941"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Harper","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.0959,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76614194,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":"58","issue":"7","first_page":"101","last_page":"108"},"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.510699987411499,"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.510699987411499,"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/T11269","display_name":"Algorithms and Data Compression","score":0.23569999635219574,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.19269999861717224,"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/i-o-efficient-algorithms","display_name":"I/O-efficient algorithms","score":0.8339999914169312},{"id":"https://openalex.org/keywords/i-o-model","display_name":"I/O model","score":0.7710000276565552},{"id":"https://openalex.org/keywords/functional-programming-languages","display_name":"functional programming languages","score":0.6899999976158142},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"memory hierarchy","score":0.8610000014305115},{"id":"https://openalex.org/keywords/sorting-algorithms","display_name":"sorting algorithms","score":0.5899999737739563},{"id":"https://openalex.org/keywords/memory-layout","display_name":"memory layout","score":0.5820000171661377}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8623545169830322},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.580824613571167},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.5201521515846252},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5062405467033386},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.4635201394557953},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.4561443030834198},{"id":"https://openalex.org/C3720319","wikidata":"https://www.wikidata.org/wiki/Q5015937","display_name":"Cache-only memory architecture","level":5,"score":0.4376258850097656},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.43309056758880615},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.4260963201522827},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.42354047298431396},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4135613441467285},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4086712598800659},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.3674866259098053},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3572711944580078},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.24913814663887024},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.20583507418632507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12362739443778992},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1126391589641571},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2776825","doi":"https://doi.org/10.1145/2776825","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2776825","pdf_url":null,"source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","fnege-3","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.646.8453","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.8453","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~rwh/papers/iolambda-cacm/cacm.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W358088974","https://openalex.org/W1145103903","https://openalex.org/W1539511971","https://openalex.org/W1583464938","https://openalex.org/W1760139041","https://openalex.org/W1970854199","https://openalex.org/W1973739282","https://openalex.org/W1987691231","https://openalex.org/W1992868693","https://openalex.org/W1999298169","https://openalex.org/W2007270285","https://openalex.org/W2024929322","https://openalex.org/W2038142281","https://openalex.org/W2061995249","https://openalex.org/W2072336782","https://openalex.org/W2073569229","https://openalex.org/W2095875205","https://openalex.org/W2100059510","https://openalex.org/W2117703621","https://openalex.org/W2149678462","https://openalex.org/W2323777246","https://openalex.org/W2490093888","https://openalex.org/W4231827376","https://openalex.org/W4292081093","https://openalex.org/W4302984605"],"related_works":["https://openalex.org/W7095213524","https://openalex.org/W4248101598","https://openalex.org/W2371384312","https://openalex.org/W2205886793","https://openalex.org/W2111709480","https://openalex.org/W7095378157","https://openalex.org/W6989193757","https://openalex.org/W2253769547","https://openalex.org/W4233423755","https://openalex.org/W4379614215"],"abstract_inverted_index":{"The":[0,59,111],"widely":[1],"studied":[2],"I/O":[3,247,273],"and":[4,48,74,90,135,171,175,197,225,272],"ideal-cache":[5,213],"models":[6,28,89,93],"were":[7],"developed":[8],"to":[9,17,125,208,231],"account":[10],"for":[11,146,201],"the":[12,24,66,72,95,104,123,148,187,195,203,209,212,243,269],"large":[13],"difference":[14],"in":[15,54,87,131,133,154,165,186,205,211,268],"costs":[16],"access":[18],"memory":[19,25,35,42,52,134,139,149,179,182,235],"at":[20,117],"different":[21],"levels":[22],"of":[23,44,56,68,98,151,194,234],"hierarchy.":[26],"Both":[27],"are":[29,80,184],"based":[30,63,222],"on":[31,65,223],"a":[32,38,118,143,155],"two":[33],"level":[34],"hierarchy":[36],"with":[37,227],"fixed":[39],"size":[40,45,57],"fast":[41],"(cache)":[43],"M":[46],",":[47],"an":[49,192,254],"unbounded":[50],"slow":[51],"organized":[53],"blocks":[55],"B.":[58],"cost":[60,144,204,210,262],"measure":[61],"is":[62,266],"purely":[64,219],"number":[67],"block":[69],"transfers":[70],"between":[71],"primary":[73],"secondary":[75],"memory.":[76],"All":[77],"other":[78],"operations":[79],"free.":[81],"Many":[82],"algorithms":[83,99,116,152,163],"have":[84],"been":[85],"analyzed":[86],"these":[88,92],"indeed":[91],"predict":[94],"relative":[96],"performance":[97],"much":[100],"more":[101],"accurately":[102],"than":[103],"standard":[105,166],"Random":[106],"Access":[107],"Machine":[108],"(RAM)":[109],"model.":[110,188,214],"models,":[112],"however,":[113],"require":[114],"specifying":[115],"very":[119],"low":[120],"level,":[121],"requiring":[122,176],"user":[124],"carefully":[126,244],"lay":[127],"out":[128],"their":[129,137],"data":[130],"arrays":[132],"manage":[136],"own":[138],"allocation.":[140],"We":[141,159,189],"present":[142],"model":[145,207],"analyzing":[147],"efficiency":[150],"expressed":[153],"simple":[156],"functional":[157,220],"language.":[158],"show":[160,198],"how":[161],"some":[162],"written":[164],"forms":[167],"using":[168],"just":[169],"lists":[170,224],"trees":[172,226],"(no":[173],"arrays)":[174],"no":[177,228],"explicit":[178],"layout":[180,236],"or":[181],"management":[183],"efficient":[185,241,248],"then":[190],"describe":[191,253],"implementation":[193],"language":[196],"provable":[199],"bounds":[200,216],"mapping":[202],"our":[206],"These":[215],"imply":[217],"that":[218],"programs":[221],"special":[229],"attention":[230],"any":[232],"details":[233],"can":[237],"be":[238],"asymptotically":[239],"as":[240,242],"designed":[245],"imperative":[246],"algorithms.":[249],"For":[250],"example":[251],"we":[252],"o":[255],"(":[256],"n/B":[257,260],"log":[258],"M/B":[259],")":[261],"sorting":[263],"algorithm,":[264],"which":[265],"optimal":[267],"ideal":[270],"cache":[271],"models.<!--":[274],"END_PAGE_1":[275],"-->":[276]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-09-22T06:50:58.402377","created_date":"2016-06-24T00:00:00"}