{"id":"https://openalex.org/W2120457453","doi":"https://doi.org/10.1145/286860.286864","title":"The memory fragmentation problem","display_name":"The memory fragmentation problem","publication_year":1998,"publication_date":"1998-10-01","ids":{"openalex":"https://openalex.org/W2120457453","doi":"https://doi.org/10.1145/286860.286864","mag":"2120457453"},"language":"en","primary_location":{"id":"doi:10.1145/286860.286864","doi":"https://doi.org/10.1145/286860.286864","is_oa":false,"landing_page_url":"https://doi.org/10.1145/286860.286864","pdf_url":null,"source":{"id":"https://openalex.org/S4306420174","display_name":"International Symposium on Memory Management","issn_l":null,"issn":null,"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 1st international symposium on Memory management","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/A5059926631","display_name":"Mark S. Johnstone","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1333370159","display_name":"Motorola (United States)","ror":"https://ror.org/01hafxd32","country_code":"US","type":"company","lineage":["https://openalex.org/I1333370159"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mark S. Johnstone","raw_affiliation_strings":["The Motorola Somerset Design Center Austin, Texas","The Motorola Somerset Design Center Austin, Texas#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Motorola Somerset Design Center Austin, Texas","institution_ids":["https://openalex.org/I1333370159"]},{"raw_affiliation_string":"The Motorola Somerset Design Center Austin, Texas#TAB#","institution_ids":["https://openalex.org/I1333370159"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008860680","display_name":"Paul R. Wilson","orcid":null,"observed_orcids":[]},"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":"Paul R. Wilson","raw_affiliation_strings":["The University of Texas at Austin, Austin, Texas"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Texas at Austin, Austin, Texas","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.8267,"has_fulltext":false,"cited_by_count":201,"citation_normalized_percentile":{"value":0.96100116,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"26","last_page":"36"},"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.6395999789237976,"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.6395999789237976,"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.33180001378059387,"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.006800000090152025,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/memory-fragmentation","display_name":"memory fragmentation","score":0.9950000047683716},{"id":"https://openalex.org/keywords/memory-usage","display_name":"memory usage","score":0.6110000014305115},{"id":"https://openalex.org/keywords/header-overhead","display_name":"header overhead","score":0.5740000009536743}],"concepts":[{"id":"https://openalex.org/C162262903","wikidata":"https://www.wikidata.org/wiki/Q343527","display_name":"Allocator","level":2,"score":0.9834480881690979},{"id":"https://openalex.org/C191015642","wikidata":"https://www.wikidata.org/wiki/Q1132459","display_name":"Fragmentation (computing)","level":2,"score":0.8322731256484985},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8038241267204285},{"id":"https://openalex.org/C34339311","wikidata":"https://www.wikidata.org/wiki/Q1050390","display_name":"C dynamic memory allocation","level":4,"score":0.45510897040367126},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.4268907904624939},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4151579439640045},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.3076423406600952},{"id":"https://openalex.org/C98986596","wikidata":"https://www.wikidata.org/wiki/Q1143031","display_name":"Semiconductor memory","level":2,"score":0.09779438376426697}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/286860.286864","doi":"https://doi.org/10.1145/286860.286864","is_oa":false,"landing_page_url":"https://doi.org/10.1145/286860.286864","pdf_url":null,"source":{"id":"https://openalex.org/S4306420174","display_name":"International Symposium on Memory Management","issn_l":null,"issn":null,"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 1st international symposium on Memory management","raw_type":"proceedings-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":22,"referenced_works":["https://openalex.org/W59163008","https://openalex.org/W1481034774","https://openalex.org/W1538592187","https://openalex.org/W1555915743","https://openalex.org/W1832837128","https://openalex.org/W1899349177","https://openalex.org/W1967121117","https://openalex.org/W1973888742","https://openalex.org/W1990421520","https://openalex.org/W1993449345","https://openalex.org/W1996027765","https://openalex.org/W2010459485","https://openalex.org/W2045036366","https://openalex.org/W2061511578","https://openalex.org/W2062667054","https://openalex.org/W2072916763","https://openalex.org/W2110210775","https://openalex.org/W2336679799","https://openalex.org/W2752853835","https://openalex.org/W4231176052","https://openalex.org/W4247557026","https://openalex.org/W4249289606"],"related_works":["https://openalex.org/W7097848676","https://openalex.org/W2461451223","https://openalex.org/W4387773704","https://openalex.org/W1952610182","https://openalex.org/W7213880154","https://openalex.org/W2168366830","https://openalex.org/W1899349177","https://openalex.org/W2143865498","https://openalex.org/W7098592809","https://openalex.org/W2977633660"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,41,51,67,88],"for":[3,23,60,68],"8":[4],"real":[5],"and":[6,9,50,77,94,110],"varied":[7],"C":[8],"C++":[10],"programs,":[11,70],"several":[12],"conventional":[13],"dynamic":[14],"storage":[15],"allocators":[16],"provide":[17,56],"near-zero":[18],"fragmentation,":[19],"once":[20],"we":[21,86],"account":[22],"overheads":[24],"due":[25],"to":[26,99,108],"implementation":[27,80],"details":[28],"such":[29],"as":[30],"headers,":[31],"alignment,":[32],"etc.":[33],"This":[34],"substantially":[35],"strengthens":[36],"our":[37,89,95,119],"previous":[38,101],"results":[39,65,91],"showing":[40],"the":[42,82],"memory":[43,58],"fragmentation":[44],"problem":[45],"has":[46],"generally":[47],"been":[48],"misunderstood,":[49],"good":[52,57],"allocator":[53,72],"policies":[54,73],"can":[55],"usage":[59],"most":[61,69,100],"programs.":[62],"The":[63],"new":[64],"indicate":[66],"excellent":[71],"are":[74,92],"readily":[75],"available,":[76],"efficiency":[78],"of":[79],"is":[81,97],"major":[83],"challenge.":[84],"While":[85],"believe":[87],"experimental":[90],"state-of-the-art":[93],"methodology":[96],"superior":[98],"work,":[102],"more":[103],"work":[104],"should":[105],"be":[106],"done":[107],"identify":[109],"study":[111],"unusual":[112],"problematic":[113],"program":[114],"behaviors":[115],"not":[116],"represented":[117],"in":[118],"sample.":[120]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}