{"id":"https://openalex.org/W1999298169","doi":"https://doi.org/10.1145/2429069.2429077","title":"Cache and I/O efficent functional algorithms","display_name":"Cache and I/O efficent functional algorithms","publication_year":2013,"publication_date":"2013-01-22","ids":{"openalex":"https://openalex.org/W1999298169","doi":"https://doi.org/10.1145/2429069.2429077","mag":"1999298169"},"language":"en","primary_location":{"id":"doi:10.1145/2429069.2429077","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2429069.2429077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-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/A5033930662","display_name":"Guy E. Blelloch","orcid":"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":true,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028720578","display_name":"Robert Harper","orcid":"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, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033930662"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":2.258,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.87694989,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"39","last_page":"50"},"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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.8238866329193115},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6299569010734558},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.615828812122345},{"id":"https://openalex.org/keywords/cache-only-memory-architecture","display_name":"Cache-only memory architecture","score":0.5554519295692444},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"Memory hierarchy","score":0.5352231860160828},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.5321689248085022},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.5159288644790649},{"id":"https://openalex.org/keywords/auxiliary-memory","display_name":"Auxiliary memory","score":0.5147678852081299},{"id":"https://openalex.org/keywords/cache-coloring","display_name":"Cache coloring","score":0.44516652822494507},{"id":"https://openalex.org/keywords/non-uniform-memory-access","display_name":"Non-uniform memory access","score":0.4412563145160675},{"id":"https://openalex.org/keywords/out-of-core-algorithm","display_name":"Out-of-core algorithm","score":0.41817569732666016},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.41813531517982483},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3667197525501251},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.16091251373291016},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12483161687850952},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.12428057193756104}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8238866329193115},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6299569010734558},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.615828812122345},{"id":"https://openalex.org/C3720319","wikidata":"https://www.wikidata.org/wiki/Q5015937","display_name":"Cache-only memory architecture","level":5,"score":0.5554519295692444},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.5352231860160828},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.5321689248085022},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.5159288644790649},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.5147678852081299},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.44516652822494507},{"id":"https://openalex.org/C133371097","wikidata":"https://www.wikidata.org/wiki/Q868014","display_name":"Non-uniform memory access","level":5,"score":0.4412563145160675},{"id":"https://openalex.org/C79470037","wikidata":"https://www.wikidata.org/wiki/Q279748","display_name":"Out-of-core algorithm","level":2,"score":0.41817569732666016},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.41813531517982483},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3667197525501251},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.16091251373291016},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12483161687850952},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12428057193756104}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2429069.2429077","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2429069.2429077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W169372349","https://openalex.org/W358088974","https://openalex.org/W1145103903","https://openalex.org/W1480005827","https://openalex.org/W1539511971","https://openalex.org/W1583464938","https://openalex.org/W1760139041","https://openalex.org/W1970854199","https://openalex.org/W1973739282","https://openalex.org/W1986843945","https://openalex.org/W1987691231","https://openalex.org/W1992868693","https://openalex.org/W2007270285","https://openalex.org/W2024929322","https://openalex.org/W2038142281","https://openalex.org/W2041645394","https://openalex.org/W2057839002","https://openalex.org/W2061995249","https://openalex.org/W2072336782","https://openalex.org/W2073569229","https://openalex.org/W2100059510","https://openalex.org/W2117703621","https://openalex.org/W2131129592","https://openalex.org/W2149678462","https://openalex.org/W2490093888","https://openalex.org/W2984291058","https://openalex.org/W4231827376","https://openalex.org/W4292081093","https://openalex.org/W4302984605","https://openalex.org/W6637839698","https://openalex.org/W6647019473","https://openalex.org/W6648594980","https://openalex.org/W6665308329"],"related_works":["https://openalex.org/W2033486618","https://openalex.org/W2159742333","https://openalex.org/W2074326206","https://openalex.org/W1569026695","https://openalex.org/W2159120180","https://openalex.org/W15724499","https://openalex.org/W2138876767","https://openalex.org/W3029535764","https://openalex.org/W1531802798","https://openalex.org/W1999298169"],"abstract_inverted_index":{"The":[0,56,105],"widely":[1],"studied":[2],"I/O":[3],"and":[4,71,87,129],"ideal-cache":[5],"models":[6,28,86,90],"were":[7],"developed":[8],"to":[9,17,119],"account":[10],"for":[11],"the":[12,24,63,69,92,101,117],"large":[13],"difference":[14],"in":[15,51,84,125,127],"costs":[16],"access":[18],"memory":[19,25,35,49,128,133],"at":[20,111],"different":[21],"levels":[22],"of":[23,43,53,65,95],"hierarchy.":[26],"Both":[27],"are":[29,77],"based":[30,60],"on":[31,62],"a":[32,38,112],"two":[33],"level":[34,115],"hierarchy":[36],"with":[37],"fixed":[39],"size":[40,44,54],"primary":[41,70],"memory(cache)":[42],"M,":[45],"an":[46],"unbounded":[47],"secondary":[48,72],"organized":[50],"blocks":[52],"B.":[55],"cost":[57],"measure":[58],"is":[59],"purely":[61],"number":[64],"block":[66],"transfers":[67],"between":[68],"memory.":[73],"All":[74],"other":[75],"operations":[76],"free.":[78],"Many":[79],"algorithms":[80,96,110],"have":[81],"been":[82],"analyzed":[83],"these":[85,89],"indeed":[88],"predict":[91],"relative":[93],"performance":[94],"much":[97],"more":[98],"accurately":[99],"than":[100],"standard":[102],"RAM":[103],"model.":[104],"models,":[106],"however,":[107],"require":[108],"specifying":[109],"very":[113],"low":[114],"requiring":[116],"user":[118],"carefully":[120],"lay":[121],"out":[122],"their":[123,131],"data":[124],"arrays":[126],"manage":[130],"own":[132],"allocation.":[134]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}