{"id":"https://openalex.org/W4230148175","doi":"https://doi.org/10.1145/2980983.2908120","title":"Assessing the limits of program-specific garbage collection performance","display_name":"Assessing the limits of program-specific garbage collection performance","publication_year":2016,"publication_date":"2016-06-02","ids":{"openalex":"https://openalex.org/W4230148175","doi":"https://doi.org/10.1145/2980983.2908120"},"language":"en","primary_location":{"id":"doi:10.1145/2980983.2908120","doi":"https://doi.org/10.1145/2980983.2908120","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2980983.2908120","pdf_url":null,"source":{"id":"https://openalex.org/S148324379","display_name":"ACM SIGPLAN Notices","issn_l":"0362-1340","issn":["0362-1340","1558-1160"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGPLAN Notices","raw_type":"journal-article"},"volume":null,"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/A5013744700","display_name":"Nicholas Jacek","orcid":"https://orcid.org/0000-0003-3021-8804","observed_orcids":["https://orcid.org/0000-0003-3021-8804"]},"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":"Nicholas Jacek","raw_affiliation_strings":["University of Massachusetts at Amherst, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Massachusetts at Amherst, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084821901","display_name":"Meng\u2010Chieh Chiu","orcid":"https://orcid.org/0009-0006-8591-5630","observed_orcids":["https://orcid.org/0009-0006-8591-5630"]},"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":"Meng-Chieh Chiu","raw_affiliation_strings":["University of Massachusetts at Amherst, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Massachusetts at Amherst, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023142437","display_name":"Benjamin M. Marlin","orcid":"https://orcid.org/0000-0002-2626-3410","observed_orcids":["https://orcid.org/0000-0002-2626-3410"]},"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":"Benjamin Marlin","raw_affiliation_strings":["University of Massachusetts at Amherst, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Massachusetts at Amherst, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015046489","display_name":"J. Eliot B. Moss","orcid":"https://orcid.org/0000-0001-6637-3641","observed_orcids":["https://orcid.org/0000-0001-6637-3641"]},"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":"Eliot Moss","raw_affiliation_strings":["University of Massachusetts at Amherst, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Massachusetts at Amherst, USA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34293136,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"51","issue":"6","first_page":"584","last_page":"598"},"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.9945999979972839,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9945999979972839,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.0031999999191612005,"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.00019999999494757503,"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.8970000147819519},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.8949999809265137},{"id":"https://openalex.org/keywords/least-squares-policy-iteration","display_name":"least-squares policy iteration","score":0.8830000162124634},{"id":"https://openalex.org/keywords/generational-garbage-collection","display_name":"generational garbage collection","score":0.7789999842643738}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.8648425936698914},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.781222939491272},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.743960976600647},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7259153127670288},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.7030312418937683},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6743102073669434},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.46075281500816345},{"id":"https://openalex.org/C133462117","wikidata":"https://www.wikidata.org/wiki/Q4929239","display_name":"Data collection","level":2,"score":0.43909966945648193},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4037333130836487},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.1901881992816925},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1802816390991211},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12765449285507202},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12399914860725403},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11686301231384277},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10679391026496887},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06695327162742615}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2980983.2908120","doi":"https://doi.org/10.1145/2980983.2908120","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2980983.2908120","pdf_url":null,"source":{"id":"https://openalex.org/S148324379","display_name":"ACM SIGPLAN Notices","issn_l":"0362-1340","issn":["0362-1340","1558-1160"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGPLAN Notices","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G6081903122","display_name":"SHF:Small: Accurate and Computationally Efficient Predictors of Java Memory Resource Consumption","funder_award_id":"1320498","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"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":11,"referenced_works":["https://openalex.org/W2000746586","https://openalex.org/W2020677283","https://openalex.org/W2053986424","https://openalex.org/W2076337359","https://openalex.org/W2094678784","https://openalex.org/W2098432798","https://openalex.org/W2123918639","https://openalex.org/W2165497190","https://openalex.org/W2602024037","https://openalex.org/W4298023569","https://openalex.org/W7001894244"],"related_works":["https://openalex.org/W2910047701","https://openalex.org/W3013809722","https://openalex.org/W2119959955","https://openalex.org/W7096530001","https://openalex.org/W2954690729","https://openalex.org/W153153778","https://openalex.org/W2199486531","https://openalex.org/W2094048149","https://openalex.org/W7099153760","https://openalex.org/W3201600950"],"abstract_inverted_index":{"We":[0,13,53,95],"consider":[1],"the":[2,16,56,71],"ultimate":[3],"limits":[4,57],"of":[5,34,47,58,60,73],"program-specific":[6,109],"garbage":[7,104],"collector":[8],"performance":[9,59],"for":[10,36,49,92],"real":[11],"programs.":[12],"first":[14],"characterize":[15],"GC":[17],"schedule":[18,46],"optimization":[19],"problem":[20],"using":[21],"Markov":[22],"Decision":[23],"Processes":[24],"(MDPs).":[25],"Based":[26],"on":[27],"this":[28],"characterization,":[29],"we":[30,79],"develop":[31],"a":[32,37,50,61,88],"method":[33],"determining,":[35],"given":[38],"program":[39],"run":[40],"and":[41],"heap":[42],"size,":[43],"an":[44],"optimal":[45],"collections":[48],"non-generational":[51],"collector.":[52],"further":[54],"explore":[55],"generational":[62],"collector,":[63],"where":[64],"it":[65],"is":[66,99],"not":[67],"feasible":[68],"to":[69,75,102],"search":[70],"space":[72],"schedules":[74],"prove":[76],"optimality.":[77],"Still,":[78],"show":[80],"significant":[81],"improvements":[82],"with":[83],"Least":[84],"Squares":[85],"Policy":[86],"Iteration,":[87],"reinforcement":[89],"learning":[90],"technique":[91],"solving":[93],"MDPs.":[94],"demonstrate":[96],"that":[97],"there":[98],"considerable":[100],"promise":[101],"reduce":[103],"collection":[105,110],"costs":[106],"by":[107],"developing":[108],"policies.":[111]},"counts_by_year":[],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2022-05-11T00:00:00"}