{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:50:05Z","timestamp":1743054605500,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540897392"},{"type":"electronic","value":"9783540897408"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89740-8_18","type":"book-chapter","created":{"date-parts":[[2008,11,27]],"date-time":"2008-11-27T08:14:24Z","timestamp":1227773664000},"page":"264-278","source":"Crossref","is-referenced-by-count":7,"title":["A Fully Parallel LISP2 Compactor with Preservation of the Sliding Properties"],"prefix":"10.1007","author":[{"given":"Xiao-Feng","family":"Li","sequence":"first","affiliation":[]},{"given":"Ligang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Abuaiadh, D., et al.: An efficient parallel heap compaction algorithm. In: The ACM Conference on Object-Oriented Systems, Languages and Applications (2004)","DOI":"10.1145\/1028976.1028995"},{"key":"18_CR2","unstructured":"Borman, S., Sanitation, S.: Understanding the IBM Java Garbage Collector, http:\/\/www.ibm.com\/"},{"issue":"4","key":"18_CR3","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":"18_CR4","unstructured":"Flood, C., et al.: Parallel garbage collection for shared memory multiprocessors. In: The USENIX JVM Symposium (2001)"},{"key":"18_CR5","unstructured":"HotSpot Virtual Machine Garbage Collection, http:\/\/java.sun.com\/javase\/technologies\/hotspot\/gc\/index.jsp"},{"key":"18_CR6","volume-title":"Garbage Collection: Algorithms for Automatic Dynamic Memory Management","author":"R.E. Jones","year":"1996","unstructured":"Jones, R.E.: Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, Chichester (1996)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Jonkers, H.B.M.: A fast garbage compaction algorithm. Information Processing Letters (July 1979)","DOI":"10.1016\/0020-0190(79)90103-0"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Kermany, H., Petrank, E.: The Compressor: Concurrent, incremental and parallel compaction. In: PLDI (2006)","DOI":"10.1145\/1133981.1134023"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"McGachey, P., Hosking, A.L.: Reducing generational copy reserve overhead with fallback compaction. In: ISMM 2006, pp. 17\u201328 (2006)","DOI":"10.1145\/1133956.1133960"},{"issue":"8","key":"18_CR10","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":"18_CR11","unstructured":"Richter, J.: Garbage Collection: Automatic Memory Management in the Microsoft .NET Framework (November 2000)"},{"key":"18_CR12","unstructured":"Tuning the memory management system, http:\/\/edocs.bea.com\/jrockit\/geninfo\/diagnos\/memman.html"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Wegiel, M., Krintz, C.: The Mapping Collector: Virtual Memory Support for Generational, Parallel, and Concurrent Compaction. In: ASPLOS 2008, Seattle, WA (March 2008)","DOI":"10.1145\/1346281.1346294"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Wu, M., Li, X.-F.: Task-pushing: a Scalable Parallel GC Marking Algorithm without Synchronization Operations. In: IEEE IPDPS 2007 (2007)","DOI":"10.1109\/IPDPS.2007.370317"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89740-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T16:14:50Z","timestamp":1557936890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89740-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540897392","9783540897408"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89740-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}