{"id":"https://openalex.org/W2157802602","doi":"https://doi.org/10.1145/1133956.1133964","title":"Improving locality with parallel hierarchical copying GC","display_name":"Improving locality with parallel hierarchical copying GC","publication_year":2006,"publication_date":"2006-06-10","ids":{"openalex":"https://openalex.org/W2157802602","doi":"https://doi.org/10.1145/1133956.1133964","mag":"2157802602"},"language":"en","primary_location":{"id":"doi:10.1145/1133956.1133964","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1133956.1133964","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":"conference-paper","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/A5062660015","display_name":"David Siegwart","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Siegwart","raw_affiliation_strings":["IBM Software Group, Hursley (UK)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Software Group, Hursley (UK)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079080602","display_name":"Martin Hirzel","orcid":"https://orcid.org/0009-0006-8840-6065"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Hirzel","raw_affiliation_strings":["IBM Watson Research Center, Hawthorne, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Watson Research Center, Hawthorne, NY","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3549,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.93237251,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"52","last_page":"63"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9977999925613403,"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.9965999722480774,"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/translation-lookaside-buffer","display_name":"Translation lookaside buffer","score":0.8619860410690308},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.8317391276359558},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8289451599121094},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7708165645599365},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.7686755657196045},{"id":"https://openalex.org/keywords/garbage-collection","display_name":"Garbage collection","score":0.690281867980957},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.6550222635269165},{"id":"https://openalex.org/keywords/copying","display_name":"Copying","score":0.6464046239852905},{"id":"https://openalex.org/keywords/locality-of-reference","display_name":"Locality of reference","score":0.5415080785751343},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.4505055248737335},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.42769619822502136},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.3740805983543396},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.3295246958732605},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1825765073299408},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.13182181119918823},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09464922547340393},{"id":"https://openalex.org/keywords/physical-address","display_name":"Physical address","score":0.06691697239875793}],"concepts":[{"id":"https://openalex.org/C116007543","wikidata":"https://www.wikidata.org/wiki/Q1071403","display_name":"Translation lookaside buffer","level":4,"score":0.8619860410690308},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.8317391276359558},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8289451599121094},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7708165645599365},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.7686755657196045},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.690281867980957},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.6550222635269165},{"id":"https://openalex.org/C2779151265","wikidata":"https://www.wikidata.org/wiki/Q1156791","display_name":"Copying","level":2,"score":0.6464046239852905},{"id":"https://openalex.org/C27602214","wikidata":"https://www.wikidata.org/wiki/Q1868547","display_name":"Locality of reference","level":3,"score":0.5415080785751343},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.4505055248737335},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.42769619822502136},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.3740805983543396},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.3295246958732605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1825765073299408},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.13182181119918823},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09464922547340393},{"id":"https://openalex.org/C41036726","wikidata":"https://www.wikidata.org/wiki/Q844824","display_name":"Physical address","level":3,"score":0.06691697239875793},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1133956.1133964","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1133956.1133964","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1562778901","https://openalex.org/W1583464938","https://openalex.org/W1702434361","https://openalex.org/W1983587324","https://openalex.org/W1987691231","https://openalex.org/W1999662401","https://openalex.org/W2000931227","https://openalex.org/W2009711341","https://openalex.org/W2013840730","https://openalex.org/W2016558956","https://openalex.org/W2033303189","https://openalex.org/W2055957613","https://openalex.org/W2057907247","https://openalex.org/W2058719553","https://openalex.org/W2080599639","https://openalex.org/W2095063920","https://openalex.org/W2095679548","https://openalex.org/W2095875205","https://openalex.org/W2098220603","https://openalex.org/W2100885195","https://openalex.org/W2117703621","https://openalex.org/W2119791681","https://openalex.org/W2126415451","https://openalex.org/W2127007340","https://openalex.org/W2139097432","https://openalex.org/W2145106894","https://openalex.org/W2147278401","https://openalex.org/W2156956446","https://openalex.org/W2160068354","https://openalex.org/W2161531345","https://openalex.org/W2166034429","https://openalex.org/W2170523074","https://openalex.org/W4236944756","https://openalex.org/W4241528185","https://openalex.org/W4247419475","https://openalex.org/W4294549613"],"related_works":["https://openalex.org/W1700460898","https://openalex.org/W1524351898","https://openalex.org/W4297378365","https://openalex.org/W2524496484","https://openalex.org/W1487406077","https://openalex.org/W2147299991","https://openalex.org/W1588734579","https://openalex.org/W4250131244","https://openalex.org/W2148255588","https://openalex.org/W2335513707"],"abstract_inverted_index":{"This":[0,69],"paper":[1,70],"shows":[2],"how":[3],"to":[4],"reduce":[5],"cache":[6,24,86],"and":[7,25,47,67,87,90],"TLB":[8,26,88],"misses":[9,27],"by":[10,64],"changing":[11],"the":[12,58],"order":[13],"in":[14,51],"which":[15],"a":[16,72],"parallel":[17,76],"garbage":[18,33],"collector":[19],"copies":[20],"heap":[21],"objects.":[22],"Reducing":[23],"improves":[28,35,82],"program":[29],"run":[30],"time.":[31],"Parallel":[32],"collection":[34],"scaling":[36,49],"on":[37,57],"multi-processor":[38,48],"machines.":[39],"Technology":[40],"trends":[41],"indicate":[42],"that":[43,80],"both":[44],"memory":[45],"locality":[46],"increase":[50],"importance.":[52],"Our":[53],"new":[54],"algorithmis":[55],"based":[56],"earlier":[59],"single-threaded":[60],"\"hierarchical":[61],"decomposi-tion\"":[62],"algorithm":[63],"Wilson,":[65],"Lam,":[66],"Moher.":[68],"presents":[71],"thorough":[73],"evaluation":[74],"of":[75,95],"hierarchical":[77],"copying,":[78],"showing":[79],"it":[81],"spatial":[83],"locality,":[84],"reduces":[85],"misses,":[89],"speeds":[91],"up":[92],"14":[93],"out":[94],"26":[96],"benchmarks.":[97]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-08-12T07:12:00.856984","created_date":"2025-10-10T00:00:00"}