{"id":"https://openalex.org/W2062989232","doi":"https://doi.org/10.1145/1133956.1133960","title":"Reducing generational copy reserve overhead with fallback compaction","display_name":"Reducing generational copy reserve overhead with fallback compaction","publication_year":2006,"publication_date":"2006-06-10","ids":{"openalex":"https://openalex.org/W2062989232","doi":"https://doi.org/10.1145/1133956.1133960","mag":"2062989232"},"language":"en","primary_location":{"id":"doi:10.1145/1133956.1133960","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1133956.1133960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th international symposium on Memory management","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/A5059391465","display_name":"Phil McGachey","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Phil McGachey","raw_affiliation_strings":["Purdue University, West Lafayette, IN"],"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027609697","display_name":"Antony L. Hosking","orcid":"https://orcid.org/0000-0002-4487-6923"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Antony L. Hosking","raw_affiliation_strings":["Purdue University, West Lafayette, IN"],"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059391465"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":3.694,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.92880424,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"10","issue":null,"first_page":"17","last_page":"28"},"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.9987000226974487,"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.9987000226974487,"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/T11424","display_name":"Security and Verification in Computing","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9958999752998352,"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/garbage-collection","display_name":"Garbage collection","score":0.9617280960083008},{"id":"https://openalex.org/keywords/copying","display_name":"Copying","score":0.8297587633132935},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7469549775123596},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7281878590583801},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6838470697402954},{"id":"https://openalex.org/keywords/manual-memory-management","display_name":"Manual memory management","score":0.6541162133216858},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.5112416744232178},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.5028354525566101},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.4478521943092346},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.42496585845947266},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3893016576766968},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2614390254020691},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.08118736743927002}],"concepts":[{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.9617280960083008},{"id":"https://openalex.org/C2779151265","wikidata":"https://www.wikidata.org/wiki/Q1156791","display_name":"Copying","level":2,"score":0.8297587633132935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7469549775123596},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7281878590583801},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6838470697402954},{"id":"https://openalex.org/C82810778","wikidata":"https://www.wikidata.org/wiki/Q6752316","display_name":"Manual memory management","level":4,"score":0.6541162133216858},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5112416744232178},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.5028354525566101},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.4478521943092346},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.42496585845947266},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3893016576766968},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2614390254020691},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.08118736743927002},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1133956.1133960","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1133956.1133960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th international symposium on Memory management","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.533.4786","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.533.4786","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.cs.purdue.edu/homes/hosking/papers/ismm06-mcgachey.pdf","raw_type":"text"},{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/733764737","is_oa":false,"landing_page_url":"https://hdl.handle.net/1885/733764737","pdf_url":null,"source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W75938397","https://openalex.org/W1509600745","https://openalex.org/W1545511997","https://openalex.org/W1583464938","https://openalex.org/W2002250868","https://openalex.org/W2028080565","https://openalex.org/W2028431783","https://openalex.org/W2037473049","https://openalex.org/W2061248378","https://openalex.org/W2073033774","https://openalex.org/W2092816829","https://openalex.org/W2120088534","https://openalex.org/W2128284389","https://openalex.org/W2140638092","https://openalex.org/W2141157907","https://openalex.org/W2152814480","https://openalex.org/W2158364508","https://openalex.org/W2168561902","https://openalex.org/W4231060654"],"related_works":["https://openalex.org/W2132258996","https://openalex.org/W2245694847","https://openalex.org/W4381304378","https://openalex.org/W2165063050","https://openalex.org/W4200058186","https://openalex.org/W4297378365","https://openalex.org/W158838145","https://openalex.org/W2592247214","https://openalex.org/W2727062031","https://openalex.org/W1700460898"],"abstract_inverted_index":{"As":[0],"programming":[1],"languages":[2],"with":[3,62,100],"managed":[4],"runtimes":[5],"become":[6],"increasingly":[7],"popular,":[8],"it":[9,80],"is":[10,81,93,162],"essential":[11],"that":[12,55,98,135,160],"virtual":[13],"machines":[14],"are":[15,138],"implemented":[16,142],"efficiently.":[17],"The":[18,91],"performance":[19,32,47,161],"of":[20,33,120,148],"the":[21,31,34,114,118,126,146],"memory":[22],"management":[23],"subsystem":[24],"can":[25,48],"be":[26,49],"a":[27,37,41,57,63,77,94,101,131,168],"defining":[28],"factor":[29],"in":[30,113],"virtualachine":[35],"as":[36],"whole.":[38],"We":[39,51,68,110,140],"present":[40],"technique":[42],"by":[43],"which":[44],"garbage":[45,78],"collector":[46,61,97],"improved.":[50],"describe":[52],"an":[53],"algorithm":[54,144],"combines":[56],"standard":[58,169],"generational":[59,95,170],"copying":[60,96,171],"mark":[64,121],"and":[65,122,151],"compact":[66,123],"collector.":[67,172],"observe":[69],"that,":[70],"since":[71],"most":[72,154],"objects":[73],"do":[74],"not":[75,82],"survive":[76],"collection,":[79],"necessary":[83],"to":[84,87,164],"reserve":[85,104,129],"space":[86],"copy":[88,103,128],"them":[89],"all.":[90],"result":[92],"operates":[99],"smaller":[102],"overhead":[105],"than":[106,167],"traditional":[107],"Appel-style":[108],"collectors.":[109],"maintain":[111],"correctness":[112],"worst":[115],"case":[116],"through":[117],"use":[119],"collection.":[124],"When":[125],"reduced":[127],"overflows,":[130],"compacting":[132],"phase":[133],"ensures":[134],"all":[136],"data":[137],"accommodated.":[139],"have":[141],"this":[143],"within":[145],"framework":[147],"Jikes":[149],"RVM":[150],"MMTk.":[152],"For":[153],"benchmarks":[155],"examined,":[156],"our":[157],"experiments":[158],"show":[159],"comparable":[163],"or":[165],"better":[166]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}