{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:15Z","timestamp":1772164035942,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T00:00:00Z","timestamp":1402531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0008714"],"award-info":[{"award-number":["DE-SC0008714"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1160602"],"award-info":[{"award-number":["1160602"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,12]]},"DOI":"10.1145\/2602988.2602990","type":"proceedings-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T08:50:25Z","timestamp":1402390225000},"page":"47-58","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Concurrent, parallel garbage collection in linear time"],"prefix":"10.1145","author":[{"given":"Steven R.","family":"Brandt","sequence":"first","affiliation":[{"name":"Louisiana State University, Baton Rouge, LA, USA"}]},{"given":"Hari","family":"Krishnan","sequence":"additional","affiliation":[{"name":"Louisiana State University, Baton Rouge, LA, USA"}]},{"given":"Gokarna","family":"Sharma","sequence":"additional","affiliation":[{"name":"Louisiana State University, Baton Rouge, LA, USA"}]},{"given":"Costas","family":"Busch","sequence":"additional","affiliation":[{"name":"Louisiana State University, Baton Rouge, LA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"URL https:\/\/github.com\/stevenrbrandt\/ MultiThreadBrownbridge.  URL https:\/\/github.com\/stevenrbrandt\/ MultiThreadBrownbridge."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646158.680003"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/381694.378819"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/640128.604155"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1108970.1108972"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1838574.1838577"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/357103.357104"},{"key":"e_1_3_2_1_8_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/3-540-15975-4_42","volume-title":"J.-P","author":"Brownbridge D.","year":"1985","unstructured":"D. Brownbridge . Cyclic reference counting for combinator machines. In J.-P . Jouannaud, editor, Functional Programming Languages and Computer Architecture , volume 201 of Lecture Notes in Computer Science , pages 273 -- 288 . 1985 . D. Brownbridge. Cyclic reference counting for combinator machines. In J.-P. Jouannaud, editor, Functional Programming Languages and Computer Architecture, volume 201 of Lecture Notes in Computer Science, pages 273--288. 1985."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380140602"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/367487.367501"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90091-7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/301589.286878"},{"key":"e_1_3_2_1_14_1","volume-title":"March","author":"Hughes R.","year":"1987","unstructured":"R. Hughes . Managing reduction graphs with reference counts. Departmental Research Report CSC\/87\/R2 , March 1987 . R. Hughes. Managing reduction graphs with reference counts. Departmental Research Report CSC\/87\/R2, March 1987."},{"key":"e_1_3_2_1_15_1","volume-title":"Garbage collection: algorithms for automatic dynamic memory management","author":"Jones R.","year":"1996","unstructured":"R. Jones and R. Lins . Garbage collection: algorithms for automatic dynamic memory management . John Wiley & Sons, Inc. , New York, NY, USA , 1996 . ISBN 0--471--94148--4. R. Jones and R. Lins. Garbage collection: algorithms for automatic dynamic memory management. John Wiley & Sons, Inc., New York, NY, USA, 1996. ISBN 0--471--94148--4."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPPW.2009.14"},{"key":"e_1_3_2_1_17_1","volume-title":"CHARM++: a portable concurrent object oriented system based on C++","author":"Kale L. V.","year":"1993","unstructured":"L. V. Kale and S. Krishnan . CHARM++: a portable concurrent object oriented system based on C++ , volume 28 . 1993 . L. V. Kale and S. Krishnan. CHARM++: a portable concurrent object oriented system based on C++, volume 28. 1993."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185475.2185478"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111596.1111597"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90088-D"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00328-3"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.09.009"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/367593.367649"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/367177.367199"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/602770.602833"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1255450.1255453"},{"key":"e_1_3_2_1_27_1","volume-title":"A Cyclic Reference Counting Algorithm and Its Proof. Internal report 88--10. Department of Informatics","author":"Pepels E.","year":"1988","unstructured":"E. Pepels , M. Plasmeijer , C. van Eekelen , and M. Eekelen . A Cyclic Reference Counting Algorithm and Its Proof. Internal report 88--10. Department of Informatics , Faculty of Science, University of Nijmegen , 1988 . E. Pepels, M. Plasmeijer, C. van Eekelen, and M. Eekelen. A Cyclic Reference Counting Algorithm and Its Proof. Internal report 88--10. Department of Informatics, Faculty of Science, University of Nijmegen, 1988."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379022.1375587"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/362426.362480"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050062"},{"key":"e_1_3_2_1_31_1","volume-title":"Implementation and analysis of two reference counting algorithms. Master thesis","author":"Salkild J.","year":"1987","unstructured":"J. Salkild . Implementation and analysis of two reference counting algorithms. Master thesis , University College , London , 1987 . J. Salkild. Implementation and analysis of two reference counting algorithms. Master thesis, University College, London, 1987."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2258996.2259008"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.113"}],"event":{"name":"ISMM '14: International Symposium on Memory Management","location":"Edinburgh United Kingdom","acronym":"ISMM '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2014 international symposium on Memory management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2602988.2602990","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2602988.2602990","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:01:17Z","timestamp":1750215677000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2602988.2602990"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,12]]},"references-count":32,"alternative-id":["10.1145\/2602988.2602990","10.1145\/2602988"],"URL":"https:\/\/doi.org\/10.1145\/2602988.2602990","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2775049.2602990","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2014,6,12]]},"assertion":[{"value":"2014-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}