{"id":"https://openalex.org/W4236944756","doi":"https://doi.org/10.1145/1065010.1065027","title":"Automatic pool allocation: improving performance by controlling data structure layout in the heap","display_name":"Automatic pool allocation: improving performance by controlling data structure layout in the heap","publication_year":2005,"publication_date":"2005-06-12","ids":{"openalex":"https://openalex.org/W4236944756","doi":"https://doi.org/10.1145/1065010.1065027"},"language":"en","primary_location":{"id":"doi:10.1145/1065010.1065027","doi":"https://doi.org/10.1145/1065010.1065027","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1065010.1065027","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 2005 ACM SIGPLAN 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/A5064241063","display_name":"Chris Lattner","orcid":"https://orcid.org/0009-0001-5195-1581","observed_orcids":["https://orcid.org/0009-0001-5195-1581"]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chris Lattner","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, Urbana, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, Urbana, IL","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059017058","display_name":"Vikram Adve","orcid":"https://orcid.org/0000-0002-0760-9690","observed_orcids":["https://orcid.org/0000-0002-0760-9690"]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vikram Adve","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, Urbana, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, Urbana, IL","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":6.2797,"has_fulltext":false,"cited_by_count":131,"citation_normalized_percentile":{"value":0.97265861,"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":"129","last_page":"142"},"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.6606000065803528,"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.6606000065803528,"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/T10126","display_name":"Logic, programming, and type systems","score":0.33059999346733093,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.0020000000949949026,"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-pool","display_name":"memory pool","score":0.7580000162124634},{"id":"https://openalex.org/keywords/program-transformation","display_name":"program transformation","score":0.5830000042915344},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"memory hierarchy","score":0.7429999709129333},{"id":"https://openalex.org/keywords/program-optimization","display_name":"program optimization","score":0.722000002861023}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8656680583953857},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.8146377801895142},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.67046058177948},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5924087166786194},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5538159012794495},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.5401301980018616},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5079246163368225},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4688098728656769},{"id":"https://openalex.org/C7263679","wikidata":"https://www.wikidata.org/wiki/Q5978076","display_name":"Pointer analysis","level":3,"score":0.44543367624282837},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.4437110722064972},{"id":"https://openalex.org/C74912251","wikidata":"https://www.wikidata.org/wiki/Q6815727","display_name":"Memory footprint","level":2,"score":0.43886271119117737},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41454237699508667},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3922836482524872},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3397035598754883},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.27383941411972046},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.21079948544502258},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10903415083885193},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1065010.1065027","doi":"https://doi.org/10.1145/1065010.1065027","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1065010.1065027","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 2005 ACM SIGPLAN conference on Programming language design and implementation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1507552563","https://openalex.org/W1825457006","https://openalex.org/W1974716894","https://openalex.org/W1981962444","https://openalex.org/W1987691231","https://openalex.org/W1998070736","https://openalex.org/W2006638707","https://openalex.org/W2010459485","https://openalex.org/W2019584651","https://openalex.org/W2019854215","https://openalex.org/W2028048148","https://openalex.org/W2032688435","https://openalex.org/W2035974062","https://openalex.org/W2038897371","https://openalex.org/W2040070287","https://openalex.org/W2046699259","https://openalex.org/W2063453797","https://openalex.org/W2074954052","https://openalex.org/W2079078409","https://openalex.org/W2085325584","https://openalex.org/W2095115578","https://openalex.org/W2095558030","https://openalex.org/W2101462267","https://openalex.org/W2115597529","https://openalex.org/W2116730320","https://openalex.org/W2129133667","https://openalex.org/W2131135493","https://openalex.org/W2152432695","https://openalex.org/W2153185479","https://openalex.org/W2153691881","https://openalex.org/W2154554979","https://openalex.org/W2161719857","https://openalex.org/W2163365446","https://openalex.org/W2166034429","https://openalex.org/W2999857599","https://openalex.org/W4231056679","https://openalex.org/W4232200131","https://openalex.org/W4236999231","https://openalex.org/W4238698576","https://openalex.org/W4250784990","https://openalex.org/W4252403066","https://openalex.org/W7011398051"],"related_works":["https://openalex.org/W7096849946","https://openalex.org/W7097124318","https://openalex.org/W650664580","https://openalex.org/W2114496697","https://openalex.org/W114095935","https://openalex.org/W2035024447","https://openalex.org/W184536514","https://openalex.org/W1607036865","https://openalex.org/W2158966201","https://openalex.org/W2033303189"],"abstract_inverted_index":{"This":[0],"paper":[1,52,112,128],"describes":[2,113],"Automatic":[3],"Pool":[4],"Allocation,":[5],"a":[6,61,74,79,145,150,195],"transformation":[7,93],"framework":[8,197],"that":[9,116,155],"segregates":[10],"distinct":[11],"instances":[12],"of":[13,33,40,85,106,147,209],"heap-based":[14,210],"data":[15,35,118,211],"structures":[16],"into":[17],"seperate":[18],"memory":[19,48,131],"pools":[20],"and":[21,50,100,108,134,149,161,181,205],"allows":[22],"heuristics":[23],"to":[24,27,121],"be":[25],"used":[26],"partially":[28],"control":[29],"the":[30,51,103,111,127,141,207],"internal":[31],"layout":[32,208],"those":[34],"structures.":[36,212],"The":[37,57,92],"primary":[38],"goal":[39],"this":[41,192],"work":[42,193],"is":[43,60],"performance":[44,137],"improvement,":[45],"not":[46,95],"automatic":[47],"management,":[49],"makes":[53],"several":[54,114],"new":[55,62,142,196],"contributions.":[56],"key":[58],"contribution":[59],"compiler":[63],"algorithm":[64],"for":[65,82,102,165,198],"partitioning":[66,120],"heap":[67,166],"objects":[68],"in":[69,173,178,185],"imperative":[70],"programs":[71,99,168,202],"based":[72],"on":[73],"context-sensitive":[75],"pointer":[76,200],"analysis,":[77],"including":[78],"novel":[80],"strategy":[81],"correct":[83],"handling":[84],"indirect":[86],"(and":[87],"potentially":[88],"unsafe)":[89],"function":[90],"calls.":[91],"does":[94],"require":[96],"type":[97],"safe":[98],"works":[101],"full":[104],"generality":[105],"C":[107],"C++.":[109],"Second,":[110],"optimizations":[115],"exploit":[117],"structure":[119],"further":[122],"improve":[123],"program":[124,136],"performance.":[125],"Third,":[126],"evaluates":[129],"how":[130],"hierarchy":[132],"behavior":[133],"overall":[135,162],"are":[138,158],"impacted":[139],"by":[140,171,203],"transformations.":[143],"Using":[144],"number":[146],"benchmarks":[148],"few":[151],"applications,":[152],"we":[153,190],"find":[154],"compilation":[156],"times":[157,164],"extremely":[159],"low,":[160],"running":[163],"intensive":[167,201],"speed":[169],"up":[170],"10-25%":[172],"many":[174],"cases,":[175,180],"about":[176],"2x":[177],"two":[179,186],"more":[182],"than":[183],"10x":[184],"small":[187],"benchmarks.":[188],"Overall,":[189],"believe":[191],"provides":[194],"optimizing":[199],"segregating":[204],"controlling":[206]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":11}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2022-05-12T00:00:00"}