{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T05:38:21Z","timestamp":1740721101161,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642171635"},{"type":"electronic","value":"9783642171642"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17164-2_19","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T10:54:39Z","timestamp":1290164079000},"page":"271-286","source":"Crossref","is-referenced-by-count":2,"title":["Index-Compact Garbage Collection"],"prefix":"10.1007","author":[{"given":"Liangliang","family":"Tong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis C. M.","family":"Lau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/367177.367199","volume":"3","author":"J. McCarthy","year":"1960","unstructured":"McCarthy, J.: Recursive Functions Symbolic Expressions and Their Computation by Machine. Communication of the ACM\u00a03(4), 184\u2013195 (1960)","journal-title":"Communication of the ACM"},{"key":"19_CR2","unstructured":"Saunders, R.A.: The LISP System for the Q-32 Computer. In: Berkeley and Bobrow, pp. 220\u2013231 (1964)"},{"issue":"8","key":"19_CR3","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1145\/358589.358625","volume":"25","author":"J.J. Martin","year":"1982","unstructured":"Martin, J.J.: An efficient garbage compaction algorithm. Communications of the ACM\u00a025(8), 571\u2013580 (1982)","journal-title":"Communications of the ACM"},{"issue":"8","key":"19_CR4","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1145\/359576.359583","volume":"21","author":"F.L. Morris","year":"1978","unstructured":"Morris, F.L.: A Time- and Space- Efficient Garbage Compaction Algorithm. Communications of the ACM\u00a021(8), 662\u2013665 (1978)","journal-title":"Communications of the ACM"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Kermany, H., Petrank, E.: The Compressor: Concurrent, Incremental, and Parallel Compaction. In: ACM Conference on Programming Language Design and Implementation, pp. 354\u2013363 (2006)","DOI":"10.1145\/1133981.1134023"},{"key":"19_CR6","volume-title":"Garbage Collection: Algorithm for Automatic Dynamic Memory Management","author":"R. Jones","year":"1997","unstructured":"Jones, R., Lins, R.: Garbage Collection: Algorithm for Automatic Dynamic Memory Management. John Wiley&Sons, Chichester (1997)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Wilson, P.R.: Uniprocessor Garbage Collection Techniques. In: Proceedings of the International Workshop on Memory Management, pp. 1\u201342 (1992)","DOI":"10.1007\/BFb0017182"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1093\/comjnl\/10.2.162","volume":"10","author":"B.K. Haddon","year":"1967","unstructured":"Haddon, B.K., Waite, W.M.: A Compaction Procedure for Variable Length Storage Element. The Computer Journal\u00a010(2), 162\u2013165 (1967)","journal-title":"The Computer Journal"},{"issue":"6","key":"19_CR9","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/358141.358147","volume":"26","author":"H. Lieberman","year":"1983","unstructured":"Lieberman, H., Hewitt, C.: A Real-time Garbage Collection Based on the Lifetimes of Objects. Communication of the ACM\u00a026(6), 419\u2013429 (1983)","journal-title":"Communication of the ACM"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"MaGachey, P., Hosking, A.L.: Reducing Generational Copy Reserve Overhead with Fallback Compaction. In: International Symposium on Memory Management, pp. 17\u201328 (2006)","DOI":"10.1145\/1133956.1133960"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Blackburn, S.M., Cheng, P., McKinley, K.S.: Oil and Water? High Performance Garbage Collection in Java with MMTk. In: International Conference on Software Engineering, pp. 137\u2013146 (2004)","DOI":"10.1109\/ICSE.2004.1317436"},{"issue":"2","key":"19_CR12","first-page":"399","volume":"44","author":"B. Alpern","year":"2005","unstructured":"Alpern, B., Augart, S., Blackburn, S.M.: The Jikes Research Virtual Machine Project: Building an Open-source Research Community. IBM Systems Journal special issue on Open Source Software\u00a044(2), 399\u2013417 (2005)","journal-title":"IBM Systems Journal special issue on Open Source Software"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1147\/sj.391.0211","volume":"39","author":"B. Alpern","year":"2000","unstructured":"Alpern, B., Attanasio, C.R., Barton, J.J.: The Jalapeno Virtual Machine. IBM Systems Journal\u00a039(1), 211\u2013238 (2000)","journal-title":"IBM Systems Journal"},{"issue":"11","key":"19_CR14","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1145\/362790.362798","volume":"13","author":"C.J. Cheney","year":"1970","unstructured":"Cheney, C.J.: A Nonrecursive List Compacting Algorithm. Communication of the ACM\u00a013(11), 677\u2013678 (1970)","journal-title":"Communication of the ACM"},{"issue":"9","key":"19_CR15","first-page":"25","volume":"9","author":"H.B.M. Jonkers","year":"1979","unstructured":"Jonkers, H.B.M.: A Fast Garbage Compaction Algorithm. Information Processing Letters\u00a09(9), 25\u201330 (1979)","journal-title":"Information Processing Letters"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Sansom, P.M.: Combining Single-Space and Two-Space Compacting Garbage Collectors. In: Proceedings of the Glasgow Workshop on Functional Programming (1991)","DOI":"10.1007\/978-1-4471-3196-0_25"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Wegiel, M., Krintz, C.: The mapping collector: virtual memory support for generational, parallel, and concurrent compaction. In: International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 91\u2013102 (2008)","DOI":"10.1145\/1346281.1346294"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0020-0190(74)90044-1","volume":"3","author":"D.A. Fisher","year":"1974","unstructured":"Fisher, D.A.: Bounded Workspace Garbage Collection in an Address Order Preserving List Processing Environment. Information Processing Letters\u00a03(1), 25\u201332 (1974)","journal-title":"Information Processing Letters"},{"issue":"11","key":"19_CR19","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1145\/355606.361886","volume":"15","author":"H.D. Baecker","year":"1972","unstructured":"Baecker, H.D.: Garbage Collection for Virtual Memory Computer Systems. Communications of the ACM\u00a015(11), 981\u2013986 (1972)","journal-title":"Communications of the ACM"},{"issue":"4","key":"19_CR20","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/69575.357226","volume":"5","author":"J. Cohen","year":"1983","unstructured":"Cohen, J., Nicolau, A.: Comparison of Compacting Algorithms for Garbage Collection. ACM Transactions on Programming Languages and Systems\u00a05(4), 532\u2013553 (1983)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Ossia, Y., Yitzhak, O.B., Segal, M.: Mostly Concurrent Compaction for Mark-Sweep GC. In: International Symposium on Memory Management, pp. 25\u201336 (2004)","DOI":"10.1145\/1029873.1029877"},{"key":"19_CR22","unstructured":"Printezis, T.: Hot-swapping between a mark&sweep and a mark&compact garbage collector in a generational environment. In: Symposium on JavaTM Virtual Machine Research and Technology Symposium, pp. 20\u201332 (2001)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Yu, Z.C.H., Lau, F.C.M., Wang, C.-L.: Exploiting Java Objects Behavior for Memory Management and Optimizations. In: Asian Symposium on Programming Language and Systems, pp. 437\u2013452 (2004)","DOI":"10.1007\/978-3-540-30477-7_29"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Hertz, M., Feng, Y., Berger, E.D.: Garbage collection without paging. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 143\u2013153 (2005)","DOI":"10.1145\/1065010.1065028"},{"key":"19_CR25","unstructured":"Yang, T., Berger, E.D., Kaplan, S.F.: CRAMM: virtual memory support for garbage-collected applications. In: Symposium on Operating Systems Design and Implementation, pp. 103\u2013116 (2006)"},{"issue":"6","key":"19_CR26","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/113446.113461","volume":"26","author":"P.R. Wilson","year":"1991","unstructured":"Wilson, P.R., Lam, M.S., Moher, T.G.: Effective \u201dStatic-graph\u201d Reorganization to Improve Locality in Garbage-Collected Systems. ACM SIGPLAN Notices\u00a026(6), 177\u2013191 (1991)","journal-title":"ACM SIGPLAN Notices"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Spoonhower, D., Blelloch, G., Harper, R.: Using Page Residency to Balance Tradeoffs in Tracing Garbage Collection. In: ACM\/USENIX International Conference on Virtual Execution Environments, pp. 57\u201367 (2005)","DOI":"10.1145\/1064979.1064989"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Shuf, Y., Gupta, M., Bordawekar, R., Singh, J.R.: Exploiting Prolific Types for Memory Management and Optimizations. In: ACM Symposium on Principles of Programming Languages, pp. 295\u2013306 (2002)","DOI":"10.1145\/503272.503300"},{"key":"19_CR29","unstructured":"The Ubuntu Operating System, http:\/\/www.ubuntu.com"},{"key":"19_CR30","unstructured":"The Java Hotspot Virtual Machine, White Paper, http:\/\/java.sun.com\/products\/hotspot\/index.html"},{"key":"19_CR31","unstructured":"The SPEC Java Virtual Machine Benchmarks, http:\/\/spec.org\/jvm98"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17164-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T02:30:33Z","timestamp":1740709833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17164-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642171635","9783642171642"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17164-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}