The GC bibliography

the Garbage Collection Bibliography

The bibliography is available in BibTeX format (including abstracts for many entries), or as PDF or in a series of web pages

I would be most grateful to receive additions, corrections and URLs of electronically available papers.

Last updated 1 October 2024.

K

[kaas89] M. Frans Kaashoek, Andrew Tanenbaum, S. Hummel, and Henri E. Bal. An efficient reliable broadcast protocol. ACM SIGOPS Operating Systems Review, 23(4):5-19, October 1989.

[kabu92] Nikos Kaburlasos. Hardware support for garbage collection in the C programming language. Master's thesis, University of Texas at Austin, 1992.

[kaeh83] Ted Kaehler and Glenn Krasner. LOOM - large object-oriented memory for Smalltalk-80 systems. In Krasner [Smalltalk-BHWA], 1983, pages 251-271.

[kaeh81] Ted Kaehler. Virtual memory for an object-oriented language. Byte, 6(8):378-387, August 1981.

[kaeh86] Ted Kaehler. Virtual memory on a narrow machine for an object-oriented language. In OOPSLA 1986 [OOPSLA86], 1986, pages 87-106. Available here.

[kafu90] Dennis Kafura, Doug Washabaugh, and Jeff Nelson. Garbage collection of actors. In OOPSLA 1990 [OOPSLA90], 1990, pages 126-134. Available here.

[kafu95] Dennis Kafura, Manibrata Mukherji, and Doug Washabaugh. Concurrent and distributed garbage collection of active objects. IEEE Transactions on Parallel and Distributed Systems, 6(4), April 1995.

[kage97] Andreas Kagedal and Saumya K. Debray. A practical approach to structure reuse of arrays in single assignment languages. In 14th International Conference on Logic Programming, pages 18-32, 1997. Available here.

[kagi91] T. Kagimasa, K. Takahashi, and S. Yoshizumi. Adaptive storage management for very large virtual/real storage systems. In ISCA 1991 [ISCA91], 1991, pages 372-379.

[kain69] Y. Kain. Block structures, indirect addressing, and garbage collection. Communications of the ACM, 12(7):395-398, July 1969.

[kakk98] Sheetal V. Kakkad, Mark S. Johnstone, and Paul R. Wilson. Portable run-time type description for conventional compilers. In Peyton~Jones and Jones [ISMM98], 1998, pages 146-153. Available here.

[kaku86] K. Kakuta, H. Nakamura, and S. Iida. Parallel reference counting algorithm.. Information Processing Letters, 23(1):33-37, 1986.

[scriptx] Kaleida Labs. ScriptX Architectural Overview.

[kala03] Aruna Kalagnanam and Sripathi Kodi. Mash that trash - incremental compaction in the IBM JDK garbage collector: How to minimize pause times and free the heap from dark matter. IBM developerWorks, June 2003. Available here.

[kale18] Sophie Kaleba, Clement Bera, and Eliot Miranda. Garbage collection evaluation infrastructure for the Cog VM. In International Workshop on Smalltalk Technologies, 2018. Available here.

[kali09c] Tomas Kalibera, Jeff Hagelberg, Filip Pizlo, Ales Plsek, Ben Titzer, and Jan Vitek. CDx: A family of real-time Java benchmarks. In JTRES 2009 [JTRES09], 2009, pages 41-50. Available here.

[kali09] Tomas Kalibera, Filip Pizlo, Antony L. Hosking, and Jan Vitek. Scheduling hard real-time garbage collection. In 30th IEEE Real-Time Systems Symposium, pages 81-92, Washington, DC, December 2009. IEEE Computer Society Press. Available here.

[kali09b] Tomas Kalibera, Marek Prochazka, Filip Pizlo, Martin Decky, Jan Vitek, and Marco Zulianello. Real-time Java in space: Potential benefits and open challenges. In Eurospace Conference on Data Systems in Aerospace (DASIA), Istanbul, Turkey, January 2009. Available here.

[kali11a] Tomas Kalibera, Jeff Hagelberg, Petr Maj, Filip Pizlo, Ben Titzer, and Jan Vitek. A family of real-time Java benchmarks. Concurrency and Computation: Practice and Experience, 23(14):1679-1700, 2011. Available here.

[kali11b] Tomas Kalibera, Filip Pizlo, Antony L. Hosking, and Jan Vitek. Scheduling real-time garbage collection on uniprocessors. ACM Transactions on Computer Systems, 3(1):8:1-29, August 2011. Available here.

[kali12] Tomas Kalibera, Matthew Mole, Richard Jones, and Jan Vitek. A black-box approach to understanding concurrency in DaCapo. In OOPSLA 2012 [OOPSLA12], 2012, pages 335-354. Available here.

[kali11] Tomas Kalibera and Richard Jones. Handles revisited: Optimising performance and memory costs in a real-time collector. In Boehm and Bacon [ISMM11], 2011, pages 89-98. Available here.

[kali13] Tomas Kalibera and Richard Jones. Rigorous benchmarking in reasonable time. In Petrank and Cheng [ISMM13], 2013, pages 63-74. Available here.

[kali09a] Tomas Kalibera. Replicating real-time garbage collector for Java. In JTRES 2009 [JTRES09], 2009, pages 100-109. Available here.

[kals89] Bill Kalsow and Eric Muller. SRC Modula-3, Version 1.2, December 1989.

[kama93] Tomio Kamada, Satoshi Matsuoka, and Akinori Yonezawa. Efficient parallel global garbage collection on massively parallel computers. In Moss et al. [OOPSLA93-gc], 1993. Available here.

[kama94] Tomio Kamada, Satoshi Matsuoka, and Akinori Yonezawa. Efficient parallel global garbage collection on massively parallel computers. In Johnson [SC94], 1994, pages 79-88. Available here.

[kand01] M. Kandemir, J. Ramanujam, M.J. Irwin, N. Vijaykrishnan, I. Kadayif, and A. Parikh. Dynamic management of scratch-pad memory space. In DAC, 2001.

[kand87] B. Kandu, S. Heng, C. Wu, and Nader Bagherzadeh. Network simulation of synchronous garbage collection algorithm. In P. Roth, editor, Simulation of computer networks1987 Symposium on the simulation of computer networks, Colorado Springs, Aug. 4-7, 1987, pages 215-222. IEEE Press, 1987.

[kapa14] Viral V. Kapadia1 and V.K. Thakar. Evaluation search operation for traditional processor and a different memory processor for garbage collection. International Journal of Computer Engineering and Technology (IJCET), 5(7):149-156, July 2014.

[kapl02] Scott Kaplan, Lyle McGeoch, and Megan Cole. Adaptive caching for demand prepaging. In Boehm and Detlefs [ISMM02], 2002, pages 114-126. Available here.

[kapo11] Kalpesh Kapoor, Kamal Lodaya, and Uday S. Reddy. Fine-grained concurrency with separation logic. Journal of Philosophical Logic, 40:583-632, October 2011. Available here.

[kare19] Benjamin Karel. Subheap-Augmented Garbage Collection. PhD thesis, University of Pennsylvania, 2019. Available here.

[kark06] Amey Karkare, Amitabha Sanyal, and Uday Khedker. Effectiveness of garbage collection in MIT/GNU Scheme, November 2006. Available here.

[kark07] Amey Karkare, Uday Khedker, and Amitabha Sanyal. Liveness of heap data for functional programs. In Heap Analysis and Verification Workshop (HAV), page 15, 2007. Available here.

[karl22] Stefan Karlsson. JDK 8272979: Generational ZGC. Technical report, OpenJDK, October 2022. Available here.

[kato07] Joost–Pieter Katoen, Thomas Noll, and Stefan Rieger. Verifying concurrent list–manipulating programs by LTL model checking. In Workshop on Heap Analysis and Verification (HAV 2007), pages 94-113, Braga, Portugal, March 2007. Available here.

[katz86] M.J. Katz. ParaTran: A transparent, transaction based runtime mechanism for parallel execution of Scheme. Master's thesis, MIT Press, June 1986.

[kauf84] Arie Kaufman. Tailored-list and recombination-delaying buddy systems. ACM Transactions on Programming Languages and Systems, 6(4):118-125, 1984.

[kawa08] Kiyokuni Kawachiya, Kazunori Ogata, and Tamiya Onodera. Analysis and reduction of memory inefficiencies in Java strings. In OOPSLA 2008 [OOPSLA08], 2008. Available here.

[kawa12] Kiyokuni Kawachiya, Mikio Takeuchi, Salikh Zakirov, and Tamiya Onodera. Distributed garbage collection for managed X10. In Proceedings of the X10 2012 Workshop, Beijing, China, June 2012. Available here.

[kawa86] K. Kawakami and J.R. Gurd. Scalable dataflow structure store. In ISCA 1986 [ISCA86], 1986.

[keja13] A. Kejariwal. A tool for practical garbage collection analysis in the cloud. In IEEE International Conference on Cloud Engineering (IC2E), pages 46-53, Redwood City, CA, 2013. Available here.

[kemp01] William E. Kempf. A garbage collection framework for C++. Technical report, The Code Project website, January 2001. Available here.

[kenn04] Andrew Kennedy and Don Syme. Combining generics, pre-compilation and sharing between software-based processes. In SPACE 2004 [SPACE04], 2004.

[kenn91a] Brian Kennedy. The features of the object oriented abstract type hierarchy (OATH). In Usenix C++ Conference, pages 41-50. USENIX Association, April 1991.

[kenn19] Roman Kennke. Shenandoah GC in JDK 13, part 1: Load reference barriers. Red Hat Developer, June 2019. Available here.

[kenn19a] Roman Kennke. Shenandoah GC in JDK 13, part 2: Eliminating the forward pointer word. Red Hat Developer, June 2019. Available here.

[kenn20] Roman Kennke. Shenandoah GC in JDK 14, part 1: Self-fixing barriers. Red Hat Developer, March 2020. Available here.

[kenn20a] Roman Kennke. Shenandoah GC in JDK 14, part 2: Concurrent roots and class unloading. Red Hat Developer, March 2020. Available here.

[kenn21] Roman Kennke. Shenandoah garbage collection in OpenJDK 16: Concurrent reference processing. Red Hat Developer, May 2021. Available here.

[kenn21a] Roman Kennke. Shenandoah in OpenJDK 17: Sub-millisecond GC pauses. Red Hat Developer, September 2021. Available here.

[kenn91] K.B. Kenny and K. Lin. Flexible real-time systems using the Flex language. IEEE Transactions on Computers, pages 70-78, May 1991.

[kerm06] Haim Kermany and Erez Petrank. The Compressor: Concurrent, incremental and parallel compaction. In Schwartzbach and Ball [PLDI06], 2006, pages 354-363. Available here.

[kerm95] A.M. Kermarrec, G. Cabillic, A. Gefflaut, C. Morin, and Isabbelle Puaut. A recoverable distributed shared memory integrating coherence and recoverability. In 25th Annual International Symposium on Fault-Tolerant Computing, 1995.

[kero07] Martin Kero, Johan Nordlander, and Per Lundgren. A correct and useful incremental copying garbage collector. In Morrisett and Sagiv [ISMM07], 2007, pages 129-140. Available here.

[kess89] Richard Kessler, Richard Jooss, Alvin Lebeck, and Mark D. Hill. Inexpensive implementations of set-associativity. In ISCA 1989 [ISCA89], 1989, pages 131-139.

[kess92] Richard Kessler, H. Carr, L. Stoller, and M. Swanson. Implementing Concurrent Scheme for the Mayfly distributed parallel processing system. Lisp and Symbolic Computation, 5(1):73-93, May 1992.

[kess89a] Richard E. Kessler and M. Livny. An analysis of distributed shared memory algorithms. In 9th International Conference on Distributed Computing Systems, June 1989.

[keyn01] Peter Keyngnaert. Conflict graph based allocation of static objects to memory banks. In SPACE 2001 [SPACE01], 2001. Available here.

[khed06] Uday Khedker, Amitabha Sanyal, and Amey Karkare. Heap reference analysis using access graphs. ACM Computing Research Repository, August 2006. Available here.

[khed07] Uday Khedker, Amitabha Sanyal, and Amey Karkare. Heap reference analysis using access graphs. ACM Transactions on Programming Languages and Systems, 30(1), 2008. Available here.

[kim91] Yasunori Kim, Takashi Chikayama, Tsuyoshi Shinogi, and Atsuhiro Goto. Incremental Garbage Collection Scheme in KL1 and its Architectural Support of PIM, pages 33-45. Plenum Press, 1991.

[kim98] Jin-Soo Kim, Xiaohan Qin, and Yarsun Hsu. Memory characterization of a parallel data mining workload. In Proc. Workload Characterization: Methodology and Case Studies. IEEE Press, November 1998. Available here.

[kim99] Taehyoun Kim, Naehyuck Chang, Namyun Kim, and Heonshik Shin. Scheduling garbage collector for embedded real-time systems. In LCTES 1999 [LCTES99], 1999, pages 55-64. Available here.

[kim00] Taehyoun Kim, Naehyuck Chang, and Heonshik Shin. Bounding worst case garbage collection time for embedded real-time systems. In 6th IEEE Real-Time Technology and Applications Symposium (RTAS), pages 46-55, Washington, DC, May/June 2000. Available here.

[kim01] Taehyoun Kim, Naehyuck Chang, and Heonshik Shin. Joint scheduling of garbage collector and hard real-time tasks for embedded applications. Journal of Systems and Software, 58(3):247-260, September 2001. Available here.

[kim14] Hongjune Kim, Seonmyeong Bak, and Jaejin Lee. Lightweight and block-level concurrent sweeping for Javascript garbage collection. In LCTES 2014 [LCTES14], 2014, pages 155-164. Available here.

[kim00a] Jin-Soo Kim and Yarsun Hsu. Memory system behavior of Java programs: Methodology and analysis. In ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pages 264-274. ACM Press, June 2000. Available here.

[kim03] Taehyoun Kim and Heonshik Shin. Scheduling-aware real-time garbage collection using dual aperiodic servers. In Real-Time and Embedded Computing Systems and Applications, volume 2968 of Lecture Notes in Computer Science, pages 1-17. Springer-Verlag, 2004. Available here.

[kimu87] Y. Kimura, K. Nishida, N. Miyauchi, and T. Chikayama. Realtime GC by multiple reference bit in KL1. In Data Flow Workshop, pages 215-222, October 1987. In Japanese.

[king02] Andy C. King. Removing GC synchronisation. In OOPSLA 2002 [OOPSLA02], 2002, pages 112-113 (Companion). Available here.

[king04] Andy C. King. Removing Garbage Collector Synchronisation. PhD thesis, Computing Laboratory, The University of Kent at Canterbury, 2004. Available here.

[king91] H. Kingdon, David R. Lester, and Geoffrey L. Burn. The HDG-machine: A highly distributed graph reducer for a transputer network. Computer Journal, 34:290-301, September 1991.

[kiri22] Marisa Kirisame, Pranav Shenoy, and Pavel Panchekha. Optimal heap limits for reducing browser memory use. In OOPSLA 2022 [OOPSLA22], 2022. Available here.

[kist98] Thomas Kistler and Michael Franz. Automated layout of data members for type-safe languages. Technical Report 98-22, University of California, Irvine, May 1998. Available here.

[kist99] Thomas Kistler and Michael Franz. The case for dynamic optimization: Improving memory-hierarchy performance by continuously adapting the internal storage layout of heap objects at run-time. Technical Report 99-21, University of California, Irvine, May 1999. Available here.

[kist00] Thomas Kistler and Michael Franz. Automated data-member layout of heap objects to improve memory-hierarchy performance. ACM Transactions on Programming Languages and Systems, 22(3):490-505, May 2000.

[kjel95] Morten Kjels\/o and Simon Jones. Memory management in flash-memory disks with data compression. In Baker [IWMM95], 1995, pages 399-413. Available here.

[klai91] Alexander C. Klaiber and Henry M. Levy. An architecture for software-controlled data prefetching. In ISCA 1991 [ISCA91], 1991, pages 43-53.

[klio09] Gabriel Kliot, Erez Petrank, and Bjarne Steensgaard. A lock-free, concurrent, and incremental stack scanning for garbage collectors. In Hosking et al. [VEE09], 2009. Available here.

[kloc11] Felix S. Klock, II and William D. Clinger. Bounded-latency regional garbage collection. In DLS 2011 [DLS11], 2011, pages 73-84. Available here.

[kloc11a] Felix S. Klock, II. Scalable Garbage Collection via Remembered Set Summarization and Refinement. PhD thesis, Northeastern University, 2011. Available here.

[kluk89] Mark G. Kluk. A study of garbage collection schemes for list processors. Master's thesis, Lehigh University, 1989.

[kluz88] F. Kluźniak. Compile-time garbage collection for ground Prolog. In 5th International Conference and Symposium on Logic Programming, pages 1490-1505, 1988.

[knig74] Tom Knight. CONS. Working Paper 80, MIT AI Laboratory, November 1974.

[know65] Kenneth C. Knowlton. A fast storage allocator. Communications of the ACM, 8(10):623-625, October 1965. Available here.

[knut73book] Donald E. Knuth. The Art of Computer Programming, volume I: Fundamental Algorithms. Addison-Wesley, second edition, 1973.

[knut73] Donald E. Knuth. Lists and Garbage Collection, chapter 2, pages 408-423. Volume I: Fundamental Algorithms of Knuth Volume 1 [knut73book], 1973, second edition, 1973.

[ko08] Sohyang Ko, Seonsoo Jun, Kiyong Kim, and Yeonseung Ry. Study on garbage collection schemes for flash-based linux swap system. In Advanced Software Engineering and Its Applications, ASEA 2008, pages 13-16, December 2008. Available here.

[koch90] B. Koch, T. Schunke, A. Dearle, F. Vaughan, C. Marlin, R. Fazekerley, and C. Barter. Cache coherence and storage management in a persistent object system. In Dearle et al. [POS90], 1991, pages 99-109.

[koga97a] Dmitry Kogan and Assaf Schuster. Collecting garbage pages in a distributed shared memory system. In 5th European Symposium on Algorithms, pages 308-325, Graz, September 1997. Available here.

[koga97] Dmitry Kogan and Assaf Schuster. Remote reference counting: Distributed garbage collection with reduced memory and communication overhead. In 5th European Symposium on Algorithms, pages 308-325, Graz, September 1997. Available here.

[koid93a] Hiroshi Koide and K. Noshita. On the copying garbage collection which preserves the genetic order. Transaction of Information Processing (IPSJ), 34(11):2395-2400, November 1993. In Japanese.

[koid93] Hiroshi Koide. Hybrid garbage collection. Master's thesis, University of Electro-Communications, Tokyo, 1993.

[koko18] Konrad Kokosa. Pro .NET Memory Management: For Better Code, Performance, and Scalability. Apress, November 2018.

[koll96] Michael Kölling and John Rosenberg. Blue - a language for teaching object-oriented programming. In 27th SIGCSE Technical Symposium on Computer Science Education, pages 190-194, March 1996. Available here.

[kolo89] Elliot K. Kolodner, Barbara Liskov, and W. Weihl. Atomic garbage collection: Managing a stable heap. In James Clifford, Bruce G. Lindsay, and David Maier, editors, ACM SIGMOD International Conference on Management of Data, pages 15-25. ACM Press, June 1989.

[kolo98] Elliot K. Kolodner and Erez Petrank. Parallel copying garbage collection using delayed allocation. Technical Report 88.384, IBM Haifa Research Lab., November 1999.

[kolo92a] Elliot K. Kolodner and W.E. Weihl. Atomic incremental garbage collection. In Bekkers and Cohen [IWMM92], 1992, pages 365-387. Available here.

[kolo93] Elliot K. Kolodner and William E. Weihl. Atomic incremental garbage collection and recovery for large stable heap. In Peter Buneman and Sushil Jajodia, editors, ACM SIGMOD International Conference on Management of Data, pages 177-186, Washington, DC, May 1993. Also MIT/LCS/TR-534, February, 1992. Available here.

[kolo87] Elliot K. Kolodner. Recovery using virtual memory. Technical Memo MIT/LCS/TM-404, MIT Laboratory for Computer Science, July 1987. Available here.

[kolo91] Elliot K. Kolodner. Atomic incremental garbage collection and recovery for large stable heap, implementing persistent object bases: Principles and practice. In Dearle et al. [POS90], 1991.

[kolo92] Elliot K. Kolodner. Atomic Incremental Garbage Collection and Recovery for a Large Stable Heap. PhD thesis, MIT Press, 1992. MIT/LCS/TR 534.

[kolo23] Iacovos G. Kolokasis, Giannos Evdorou, Shoaib Akram, Christos Kozanitis, Anastasios Papagiannis, Foivos S. Zakkak, Polyvios Pratikakis, and Angelos Bilas. TeraHeap: Reducing memory pressure in managed big data frameworks. In Aamodt et al. [ASPLOS23], 2023, page 694–709. Available here.

[koop90] Philip J. Koopman, Jr., Peter Lee, and Daniel P. Siewiorek. Cache performance of combinator graph reduction. In PLDI 1989 [PLDI89], 1989, pages 110-119. Available here.

[koop92] Philip J. Koopman, Peter Lee, and Daniel P. Siewiorek. Cache behavior of combinator graph reduction. ACM Transactions on Programming Languages and Systems, 14(2):265-297, April 1992.

[kopa23] Chaitanya S. Koparkar, Vidush Singhal, Aditya Gupta, Mike Rainey, Michael Vollmer, Artem Pelenitsyn, Sam Tobin-Hochstadt, Milind Kulkarni, and Ryan R. Newton. Garbage collection for mostly serialized heaps. In Bond et al. [ISMM24], 2024, pages 1–-14. Available here.

[kord92] R. Kordale, John Shilling, and Mustaque Ahamad. Garbage collection in distributed shared memory systems. Technical Report TR GIT-CC-92/45, Georgia Institute of Technology, 1992.

[kord93a] R. Kordale, Mustaque Ahamad, and John Shilling. Distributed/concurrent garbage collection in distributed shared memory systems. In IWOOOS 1993 [IWOOOS93], 1993.

[kord93] R. Kordale and Mustaque Ahamad. A scalable cyclic garbage detection algorithm for distributed systems. In Moss et al. [OOPSLA93-gc], 1993. Available here.

[korn85] David G. Korn and Kiem-Phong Vo. In search of a better malloc. In USENIX Summer Conference, pages 489-506, Portland, Oregon, 1985. USENIX Association.

[kowa79] T. Kowaltowski. Data structures and correctness of programs. Journal of the ACM, 26(2):283-301, April 1979.

[krak00] S. Krakowiak and S.K. Shrivastava, editors. Recent Advances in Distributed Systems, volume 1752 of Lecture Notes in Computer Science. Springer-Verlag, February 2000. Available here.

[kral06] Andreas Krall. Static verification of global heap references in Java native libraries. In SPACE 2006 [SPACE06], 2006, pages 98-100. Available here.

[kran86] David A. Kranz, Richard Kelsey, Jonathan Rees, Paul Hudak, James Philbin, and Norman Adams. ORBIT: An optimizing compiler for Scheme. In SIGPLAN 1986 [PLDI86], 1986, pages 219-233. Available here.

[kran89] David A. Kranz, Robert H. Halstead, and Eric Mohr. Mul-T: A high-performance parallel Lisp. In PLDI 1989 [PLDI89], 1989, pages 81-90. Available here.

[kran88] David A. Kranz. ORBIT: An Optimizing Compiler For Scheme. PhD thesis, Yale University, February 1988.

[Smalltalk-BHWA] Glenn Krasner, editor. Smalltalk-80: Bits of History, Words of Advice. Addison-Wesley, 1983.

[krau21] Nicolas Krauter, Patrick Raaf, Peter Braam, Reza Salkhordeh, Sebastian Erdweg, and André Brinkmann. Persistent software transactional memory in Haskell. Proceedings of the ACM on Programming Languages, 5(ICFP):63:1-63:29, August 2021. Available here.

[krie93] E. Ulrich Kriegel. A conservative garbage collector for an EuLisp to ASM/C compiler. In Moss et al. [OOPSLA93-gc], 1993. Available here.

[krie90] O. Krieger and Michael Stumm. An optimistic approach for consistent replicated data for multicomputers. In Proc. HICCSS, 1990.

[kris20] R. Madhava Krishnan, Jaeho Kim, Ajit Mathew, Xinwei Fu, Anthony Demeri, Changwoo Min, and Sudarsun Kannan. Durable transactional memory can scale with TimeStone. In Larus et al. [ASPLOS20], 2020, pages 335-349. {ASPLOS 2020 was canceled because of COVID-19. Available here.

[kris06] Neelakantan Krishnaswami. Separation logic for a higher-order typed language. In SPACE 2006 [SPACE06], 2006, pages 73-82. Available here.

[krog73] S. Krogdahl. A dynamic storage allocation problem. Information Processing Letters, 2:96-99, 1973.

[krue89] Steven Krueger. Vlsi-appropriate garbage collection support. In Jose G Delgado-Frias and Will R. Moore, editors, VLSI for artificial intelligence, The Kluwer international series in engineering and computer science. Kluwer Academic Publishers, 1989.

[kuec91] Wolfgang Küchlin and Nicholas J. Nevin. On multi-threaded list-processing and garbage collection. Technical Report OSU-CISRC-3/91-TR11, Ohio State University, March 1991.

[kuec91a] Wolfgang Küchlin and Nicholas J. Nevin. On multi-threaded list-processing and garbage collection. In 3rd IEEE Symposium on Parallel and Distributed Processing, pages 894-897. IEEE Press, December 1991.

[kuec91b] Wolfgang Küchlin. A space-efficient parallel garbage collection algorithm. In SC 1991 [SC91], 1991, pages 40-46. Available here.

[kuma14] Vivek Kumar, Stephen M. Blackburn, and David Grove. Friendly barriers: Efficient work-stealing with return barriers. In Petrank et al. [VEE14], 2014. Available here.

[kuma02] Sanjeev Kumar and Kai Li. Dynamic memory management for programmable devices. In Boehm and Detlefs [ISMM02], 2002, pages 139-149. Available here.

[kuma16] Prasanna Kumar K., Amitabha Sanyal, and Amey Karkare. Liveness-based garbage collection for lazy languages. In Zhang and Flood [ISMM16], 2016, pages 122-133. Available here.

[kung77] H.T. Kung and S.W. Song. An efficient parallel garbage collection system and its correctness proof. In IEEE Symposium on Foundations of Computer Science, pages 120-131, Providence, Rhode Island, October 1977. IEEE Press. Available here.

[kung77b] H.T. Kung and S.W. Song. An efficient parallel garbage collection system and its correctness proof.. Department of computer science report, Carnegie Mellon University, September 1977.

[kung77a] H.T. Kung and S.W. Song. Performance analysis of a parallel garbage collection system. Department of computer science report, Carnegie Mellon University, August 1977.

[kung83] Delphine T. H Kung. Garbage collection of linked data structures: An example in a network oriented database management system. Master's thesis, Rochester Institute of Technology, 1983.

[kuri90] Satoshi Kurihara, Mikio Inari, Norihisa Doi, Kazuki Yasumatsu, and Takemi Yamazaki. SPiCE collector : The run-time garbage collector for Smalltalk-80 programs translated into C. In Jul and Juul [OOPSLA90-gc], 1990. Available here.

[kuro75] T. Kurokawa. New marking algorithms for garbage collection. In 2nd USA-Japan Computer Conference, pages 585-584, 1975.

[kuro81] T. Kurokawa. A new fast and safe marking algorithm. Software: Practice and Experience, 11:671-682, 1981.

[kuse91] Kazushi Kuse and Tsutomu Kamimura. Generational garbage collection for C-based object-oriented languages. In Wilson and Hayes [OOPSLA91-gc], 1991. Available here.

[kwon03] Jagun Kwon, Andy J. Wellings, and Steve King. Predictable memory utilization in the Ravenscar-Java profile. In Puschner et al. [ISORC03], 2003, pages 267-274. Available here.

[kwon07a] Ohhoon Kwon, Jaewoo Lee, and Kern Koh. EF-greedy: A novel garbage collection policy for flash memory based embedded systems. In Computational Science, ICCS 2007, volume 4490 of Lecture Notes in Computer Science, pages 913-920. Springer-Verlag, 2007. Available here.

[kwon07b] Ohhoon Kwon, Yeonseung Ryu, and Kern Koh. An efficient garbage collection policy for flash memory based swap systems. In 2007 International Conference on Computational Science and its Applications (ICCSA), volume 4705 of Lecture Notes in Computer Science, pages 213-223, Kuala Lumpur, Malaysia, 2007. Springer-Verlag. Available here.

[kwon07] Ohhoon Kwon and K Koh. Swap-aware garbage collection for NAND flash memory based embedded systems. In 7th IEEE International Conference on Computer and Information Technology, CIT 2007, pages 787-792, November 2007. Available here.

[kwon04] Jagun Kwon and Andy J. Wellings. Memory management based on method invocation in RTSJ. In Meersman et al. [JTRES04], 2004, pages 333-345. Available here.

[kyry04] Sergiy Kyrylkov, Darko Stefanović, and J. Eliot B. Moss. Design and implementation of a 64-bit PowerPC port of Jikes RVM 2.0.3. In 2nd Workshop on Managed Runtime Environments (MRE), 2004.

[kyry05] Sergiy Kyrylkov and Darko Stefanović. A study of garbage collection with a large address space for server applications. Technical Report TR-CS-2005-1, University of New Mexico, February 2005.

[kyry03] Sergiy Kyrylkov. Jikes Research Virtual Machine - design and implementation of a 64-bit PowerPC port. Master's thesis, University of New Mexico, 2003.

[kyry05a] Sergiy Kyrylkov. 64-bit computing and JVM performance. Dr. Dobb's Journal, 30(370):24-27, March 2005.