{"id":"https://openalex.org/W1998141415","doi":"https://doi.org/10.1145/378795.378821","title":"Composing high-performance memory allocators","display_name":"Composing high-performance memory allocators","publication_year":2001,"publication_date":"2001-05-01","ids":{"openalex":"https://openalex.org/W1998141415","doi":"https://doi.org/10.1145/378795.378821","mag":"1998141415"},"language":"en","primary_location":{"id":"doi:10.1145/378795.378821","doi":"https://doi.org/10.1145/378795.378821","is_oa":false,"landing_page_url":"https://doi.org/10.1145/378795.378821","pdf_url":null,"source":{"id":"https://openalex.org/S4393917474","display_name":"ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","issn_l":"1531-7102","issn":["1531-7102"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5053730492","display_name":"Emery D. Berger","orcid":"https://orcid.org/0000-0002-3222-3271","observed_orcids":["https://orcid.org/0000-0002-3222-3271"]},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emery D. Berger","raw_affiliation_strings":["Dept. of Computer Sciences, The University of Texas at Austin, Austin, TX","Dept. of Computer Sciences, The University of Texas at Austin, Austin, TX#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Sciences, The University of Texas at Austin, Austin, TX","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Dept. of Computer Sciences, The University of Texas at Austin, Austin, TX#TAB#","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113516138","display_name":"Benjamin G. Zorn","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin G. Zorn","raw_affiliation_strings":["Microsoft Research, One Microsoft Way, Redmond, WA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, One Microsoft Way, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087054368","display_name":"Kathryn S. McKinley","orcid":"https://orcid.org/0000-0002-7188-2501","observed_orcids":["https://orcid.org/0000-0002-7188-2501"]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kathryn S. McKinley","raw_affiliation_strings":["Dept. of Computer Science, University of Massachusetts, Amherst, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Massachusetts, Amherst, MA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1827,"has_fulltext":false,"cited_by_count":155,"citation_normalized_percentile":{"value":0.94584245,"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":"114","last_page":"124"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.6279000043869019,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.6279000043869019,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.35350000858306885,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.002400000113993883,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/memory-allocators","display_name":"memory allocators","score":0.9919999837875366},{"id":"https://openalex.org/keywords/high-performance-programming","display_name":"high-performance programming","score":0.6549999713897705}],"concepts":[{"id":"https://openalex.org/C162262903","wikidata":"https://www.wikidata.org/wiki/Q343527","display_name":"Allocator","level":2,"score":0.7321876883506775},{"id":"https://openalex.org/C2778805511","wikidata":"https://www.wikidata.org/wiki/Q1713","display_name":"Citation","level":2,"score":0.7210495471954346},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5993623733520508},{"id":"https://openalex.org/C2777819327","wikidata":"https://www.wikidata.org/wiki/Q5009918","display_name":"DEPT","level":2,"score":0.5330204963684082},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.4854598641395569},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.45064836740493774},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.330646812915802},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C71240020","wikidata":"https://www.wikidata.org/wiki/Q186011","display_name":"Stereochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1145/378795.378821","doi":"https://doi.org/10.1145/378795.378821","is_oa":false,"landing_page_url":"https://doi.org/10.1145/378795.378821","pdf_url":null,"source":{"id":"https://openalex.org/S4393917474","display_name":"ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","issn_l":"1531-7102","issn":["1531-7102"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1.2112","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.2112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umass.edu/~emery/pubs/berger-pldi2001.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.41","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.41","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.umass.edu/pub/osl/papers/pldi2001.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.21.9227","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.9227","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.utexas.edu/pub/emery/papers/pldi2001.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.384.3154","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.384.3154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dacapo-group.org/papers/pldi2001.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.96.4727","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.4727","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/ftp/pub/emery/papers/mstr2000-113.pdf","raw_type":"text"},{"id":"pmh:oai:scholarworks.umass.edu:cs_faculty_pubs-1386","doi":null,"is_oa":false,"landing_page_url":"https://scholarworks.umass.edu/cs_faculty_pubs/387","pdf_url":null,"source":{"id":"https://openalex.org/S4306402240","display_name":"ScholarWorks@UMassAmherst (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department Faculty Publication Series","raw_type":"text"},{"id":"pmh:oai:scholarworks.umass.edu:20.500.14394/10047","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/20.500.14394/10047","pdf_url":null,"source":{"id":"https://openalex.org/S4306402057","display_name":"Scholarworks (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"published","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W159894973","https://openalex.org/W1899349177","https://openalex.org/W1970854199","https://openalex.org/W1974716894","https://openalex.org/W1990284370","https://openalex.org/W2003018393","https://openalex.org/W2010035000","https://openalex.org/W2069789831","https://openalex.org/W2077830885","https://openalex.org/W2085325584","https://openalex.org/W2087875803","https://openalex.org/W2115680394","https://openalex.org/W2120457453","https://openalex.org/W2128274900","https://openalex.org/W2139165932","https://openalex.org/W2163365446","https://openalex.org/W2169934995","https://openalex.org/W2278011425","https://openalex.org/W2561675875","https://openalex.org/W2610229903","https://openalex.org/W4249713879","https://openalex.org/W4250051741","https://openalex.org/W4250784990"],"related_works":["https://openalex.org/W7096995783","https://openalex.org/W7099200456","https://openalex.org/W2566521798","https://openalex.org/W1974716894","https://openalex.org/W7098592809","https://openalex.org/W7102674040","https://openalex.org/W3022031910","https://openalex.org/W1588085739","https://openalex.org/W7098251413","https://openalex.org/W2144538993"],"abstract_inverted_index":{"Current":[0],"general-purpose":[1,93,158],"memory":[2,35,52,74],"allocators":[3,18,53,75,94,123,133,173,197],"do":[4],"not":[5],"provide":[6],"sufficient":[7],"speed":[8],"or":[9,108,127],"flexibility":[10],"for":[11,72],"modern":[12],"high-performance":[13],"applications.":[14],"Highly-tuned":[15],"general":[16,194],"purpose":[17],"have":[19],"per-operation":[20],"costs":[21],"around":[22],"one":[23,168],"hundred":[24],"cycles,":[25],"while":[26],"the":[27,129,138,142,165,170,186],"cost":[28],"of":[29,42,131,169,190,193],"an":[30],"operation":[31],"in":[32,122,135],"a":[33,40,57,67,157,178,199],"custom":[34,51,91,196],"allocator":[36,118,140,159,181],"can":[37,99,151],"be":[38,100,152],"just":[39],"handful":[41],"cycles.":[43],"To":[44],"achieve":[45],"high":[46],"performance,":[47],"programmers":[48,88],"often":[49],"write":[50],"from":[54],"scratch":[55],"--":[56],"difficult":[58],"and":[59,69,82,92,120,141,188,195],"error-prone":[60],"process.":[61],"In":[62],"this":[63,115,149],"paper,":[64],"we":[65],"present":[66],"flexible":[68],"efficient":[70],"infrastructure":[71,116,150],"building":[73],"that":[76,98,114,124,160,183],"is":[77],"based":[78],"on":[79],"C++":[80],"templates":[81],"inheritance.":[83],"This":[84],"novel":[85],"approach":[86],"allows":[87],"to":[89,154,164],"build":[90,156],"as":[95],"\"heap":[96],"layers\"":[97],"composed":[101],"without":[102],"incurring":[103],"any":[104,191],"additional":[105,109],"runtime":[106],"overhead":[107],"programming":[110],"cost.":[111],"We":[112,146,175],"show":[113,148],"simplifies":[117],"construction":[119],"results":[121],"either":[125],"match":[126],"improve":[128],"performance":[130,162],"heavily-tuned":[132],"written":[134],"C,":[136],"including":[137],"Kingsley":[139],"GNU":[143],"obstack":[144],"library.":[145],"further":[147],"used":[153],"rapidly":[155],"has":[161],"comparable":[163],"Lea":[166],"allocator,":[167],"best":[171],"uniprocessor":[172],"available.":[174],"thus":[176],"demonstrate":[177],"clean,":[179],"easy-to-use":[180],"interface":[182],"seamlessly":[184],"combines":[185],"power":[187],"efficiency":[189],"number":[192],"within":[198],"single":[200],"application.":[201],"1.":[202]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2016-06-24T00:00:00"}