{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:41:27Z","timestamp":1780994487967,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,10,24]],"date-time":"2004-10-24T00:00:00Z","timestamp":1098576000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,10,24]]},"DOI":"10.1145\/1029873.1029881","type":"proceedings-article","created":{"date-parts":[[2005,1,30]],"date-time":"2005-01-30T17:55:16Z","timestamp":1107107716000},"page":"61-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["Automatic heap sizing"],"prefix":"10.1145","author":[{"given":"Ting","family":"Yang","sequence":"first","affiliation":[{"name":"University of Massachusetts, Amherst, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew","family":"Hertz","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emery D.","family":"Berger","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Scott F.","family":"Kaplan","sequence":"additional","affiliation":[{"name":"Amherst College, Amherst, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. Eliot B.","family":"Moss","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2004,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/98457.98753"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.391.0211"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/320384.320418"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380190206"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676176"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/850662.850665"},{"key":"e_1_3_2_1_7_1","unstructured":"BEA WebLogic. Technical white paper---JRockit: Java for the enterprise. http:\/\/www.bea.com\/content\/news_events\/white_papers\/BEA_JRockit_wp.pdf.  BEA WebLogic. Technical white paper---JRockit: Java for the enterprise. http:\/\/www.bea.com\/content\/news_events\/white_papers\/BEA_JRockit_wp.pdf."},{"key":"e_1_3_2_1_8_1","first-page":"137","volume-title":"High Performance Garbage Collection in Java with MMTk. In ICSE 2004, 26th International Conference on Software Engineering","author":"Blackburn S. M.","year":"2004","unstructured":"S. M. Blackburn , P. Cheng , and K. S. McKinley . Oil and Water? High Performance Garbage Collection in Java with MMTk. In ICSE 2004, 26th International Conference on Software Engineering , pages 137 -- 146 , May 2004 . S. M. Blackburn, P. Cheng, and K. S. McKinley. Oil and Water? High Performance Garbage Collection in Java with MMTk. In ICSE 2004, 26th International Conference on Software Engineering, pages 137--146, May 2004."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380180902"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/504282.504308"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/141471.141501"},{"key":"e_1_3_2_1_14_1","unstructured":"JavaSoft. J2SE 1.5.0 Documentation---Garbage Collector Ergonomics. Available at http:\/\/java.sun.com\/j2se\/1.5.0\/docs\/guide\/vm\/gc-ergonomics.html.  JavaSoft. J2SE 1.5.0 Documentation---Garbage Collector Ergonomics. Available at http:\/\/java.sun.com\/j2se\/1.5.0\/docs\/guide\/vm\/gc-ergonomics.html."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/301453.301479"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/778553.778554"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/339331.339422"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/800055.802040"},{"key":"e_1_3_2_1_19_1","unstructured":"Novell. Documentation: NetWare 6---Optimizing Garbage Collection. Available at http:\/\/www.novell.com\/documentation\/index.html.  Novell. Documentation: NetWare 6---Optimizing Garbage Collection. Available at http:\/\/www.novell.com\/documentation\/index.html."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(02)00226-2"},{"key":"e_1_3_2_1_21_1","first-page":"101","volume-title":"Proceedings of The 1999 USENIX Annual Technical Conference","author":"Wilson P. R.","year":"1999","unstructured":"P. R. Wilson , S. F. Kaplan , and Y. Smaragdakis . The case for compressed caching in virtual memory systems . In Proceedings of The 1999 USENIX Annual Technical Conference , pages 101 -- 116 , Monterey, California , June 1999 . USENIX Association. P. R. Wilson, S. F. Kaplan, and Y. Smaragdakis. The case for compressed caching in virtual memory systems. In Proceedings of The 1999 USENIX Annual Technical Conference, pages 101--116, Monterey, California, June 1999. USENIX Association."}],"event":{"name":"ISMM04: 2004 International Symposium on Memory Management ( in conjunction with OOPSLA 2004 Conference )","location":"Vancouver BC Canada","acronym":"ISMM04","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 4th international symposium on Memory management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1029873.1029881","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1029873.1029881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:03Z","timestamp":1750264263000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1029873.1029881"}},"subtitle":["taking real memory into account"],"short-title":[],"issued":{"date-parts":[[2004,10,24]]},"references-count":19,"alternative-id":["10.1145\/1029873.1029881","10.1145\/1029873"],"URL":"https:\/\/doi.org\/10.1145\/1029873.1029881","relation":{},"subject":[],"published":{"date-parts":[[2004,10,24]]},"assertion":[{"value":"2004-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}