[cahi93] Vinny Cahill, Seán Baker, Chris Horn, and Gradimir Stavovic. The Amadeus GRT - generic runtime support for distributed persistent programming. In OOPSLA 1993 [OOPSLA93], 1993. Technical report TCD-CS-93-37. Available here.
[cai20] Wentao Cai, Haosen Wen, H. Alan Beadle, Chris Kjellqvist, Mohammad Hedayati, and Michael L. Scott. Understanding and optimizing persistent memory allocation. In Maas and Ding [ISMM20], 2020, pages 60-–73. Available here.
[cai21] Zixian Cai, Stephen M. Blackburn, Michael D. Bond, and Martin Maas. An empirical lower bound on the overheads of production garbage collectors. https://arxiv.org/pdf/2112.07880.pdf, December 2021. Available here.
[cai22] Zixian Cai, Stephen M. Blackburn, Michael D. Bond, and Martin Maas. Distilling the real cost of production garbage collectors. In ISPASS 2022 [ISPASS22], 2022.
[cai03] Hao Cai and Andy J. Wellings. Towards a high-integrity real-time Java virtual machine. In On the Move to Meaningfull Internet Systems 2003: Workshop on Java Technologies for Real-Time and Embedded Systems, volume 2889 of Lecture Notes in Computer Science, pages 319-334. Springer-Verlag, 2003. Available here.
[calc03] Cristiano Calcagno, Peter O'Hearn, and Richard Bornat. Program logic and equivalence in the presence of garbage collection. Theoretical Computer Science, 298(3), 2003. Available here.
[calc01] Cristiano Calcagno. Program logics in the presence of garbage collection. In SPACE 2001 [SPACE01], 2001. Available here.
[cald94] Brad Calder, Dirk Grunwald, and Benjamin Zorn. Quantifying behavioral differences between C and C++ programs. Journal of Programming Languages, 2(4):313-351, 1994. Available here.
[cald98] Brad Calder, Chandra Krintz, S. John, and T. Austin. Cache-conscious data placement. In ASPLOS 1998 [ASPLOS98], 1998, pages 139-149. Available here.
[came15] Callum Cameron, Jeremy Singer, and David Vengerov. The judgment of Forseti: Economic utility for dynamic heap sizing of multiple runtimes. In Bond and Hosking [ISMM15], 2015, pages 143-156. Available here.
[came14] Callum Cameron and Jeremy Singer. We are all economists now: Economic utility for multiple heap sizing. In Proceedings of the 9th Implementation, Compilation, Optimization of OO Languages, Programs and Systems workshop, 2014.
[camp71] John A. Campbell. A note on an optimal-fit method for dynamic allocation of storage. Computer Journal, 14(1):7-9, February 1971.
[camp74] John A. Campbell. Optimal use of storage in a simple model of garbage collection. Information Processing Letters, 3(2):374, November 1974.
[camp14] Matthew Campbell. Automatic Reference Counting, pages 147-151. Apress, Berkeley, CA, 2014. Available here.
[camp86] J. Campin and Malcolm Atkinson. A persistent store garbage collector with statistical facilities. Technical report, Universities of Glasgow and St Andrews, 1986.
[camp93a] Alvaro E. Campos and David R. Hanson. Garbage collection in EZ. In R. Baeza-Yates, editor, 13th International Conference on Computer Science, La Serena, Chile, 1993. Plenum Press.
[camp93] Alvaro E. Campos. Distributed, Garbage-Collected, Persistent, Virtual Address Spaces. {PhD dissertation, Princeton University, Department of Computer Science, June 1993. Maybe at http://ncstrl.cs.princeton.edu/reports/1993/419.ps.Z. Available here.
[cann92] D.C. Cann, J.T. Feo, A.D.W. Bohoem, and Rod R. Oldehoeft. SISAL Reference Manual: Language Version 2.0, 1992. Available here.
[cann88] D.C. Cann and Rod R. Oldehoeft. Reference count and copy elimination for parallel applicative computing. Technical Report CS-88-129, Department of Computer Science, Colorado State University, Fort Collins, CO, 1988.
[cann00] Dante Cannarozzi, Michael P. Plezbert, and Ron Cytron. Contaminated garbage collection. In PLDI 2000 [PLDI00], 2000, pages 264-273. Available here.
[cons06] Dominique Cansella and Dominique Méry. Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithm. Theoretical Computer Science, 363(3):318-337, November 2006.
[cao11] Ting Cao, Stephen M. Blackburn, Tiejun Gao, and Kathryn S. McKinley. Virtual machine services: An opportunity for hardware customization. In Workshop on Energy-efficient Computing for a Sustainable World (EESC), Porto Alegre, Brazil, December 2011. Held in conjunction with MICRO-44. Available here.
[cao12] Ting Cao, Stephen M. Blackburn, Tiejun Gao, and Kathryn S. McKinley. The yin and yang of power and performance for asymmetric hardware and managed software. In ISCA 2012 [ISCA12], 2012. Available here.
[cao12a] Ting Cao, Stephen M. Blackburn, and Kathryn S. McKinley. System design for heterogeneity: The virtual machine services test case. Technical Report TR-CS-12-01, Australian National University, 2012. Available here.
[capl88] Michael Caplinger. A memory allocator with garbage collection for C. In USENIX Winter Conference, pages 323-323. USENIX Association, 1988.
[car10] David Car. A reference counting implementation in Fortran 95/2003. SIGPLAN Fortran Forum, 29(1):21–28, April 2010. Available here.
[card88] Luca Cardelli, James Donahue, Lucille Glassman, Mick Jordan, Bill Kalsow, and Greg Nelson. Modula-3 report (revised). Research Report PRC-131, DEC Systems Research Center and Olivetti Research Center, 1988.
[card92] Luca Cardelli, James Donahue, Lucille Glassman, Mick Jordan, Bill Kalsow, and Greg Nelson. Modula-3 language definition. ACM SIGPLAN Notices, 27(8):15-42, August 1992. Available here.
[card84] Luca Cardelli. Compiling a functional language. In Steele [LFP84], 1984, pages 208-217. Available here.
[card91] Luca Cardelli. Typeful programming. In E.J. Neuhold and M. Paul, editors, Formal Description of Programming Concepts. Springer-Verlag, 1991. Revised 1 January, 1993. Available here.
[carl92] Giuliano Carlini and Susan Rendina. Garbage collection for C programs. Dr. Dobb's Journal, 17(11), November 1992.
[carl90] Svante Carlsson, Christer Mattsson, and Mats Bengtsson. A fast expected-time compacting garbage collection algorithm. In Jul and Juul [OOPSLA90-gc], 1990. Available here.
[carl91] Svante Carlsson, Christer Mattsson, Mats Bengtsson, and Patricio Poblete. A new compacting garbage collection algorithm with a good average-case performance. In STACS-91, 1991.
[carl87] M. Carlsson. Freeze, indexing and other implementation issues in the WAM. In Lassez [ICLP87], 1987, pages 40-58.
[carp15a] Maria Carpen-Amarie, Dave Dice, Patrick Marlier, Gaël Thomas, and Pascal Felber. Evaluating HTM for pauseless garbage collectors in Java. In The 13th IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA-15), Helsinki, Finland, 2015. Available here.
[carp15] Maria Carpen-Amarie, Patrick Marlier, Pascal Felber, and Gaël Thomas. A performance study of Java garbage collectors on multicore architectures. In Proceedings of the Sixth International Workshop on Programming Models and Applications for Multicores and Manycores (PMAM'15), pages 20-29, San Francisco, CA, 2015. ACM Press. Available here.
[carp16] Maria Carpen-Amarie, Dave Dice, Gaël Thomas, and Pascal Felber. Transactional pointers: Experiences with HTM-based reference counting in C++. In Networked Systems (NETSYS), volume 9944 of Lecture Notes in Computer Science. Springer, 2016. Available here.
[carp17] Maria Carpen-Amarie, Yaroslav Hayduk, Pascal Felber, Christof Fetzer, Gaël Thomas, and Dave Dice. Towards an efficient pauseless Java GC with selective HTM-based access barriers. In Proceedings of the 14th International Conference on Managed Languages and Runtimes, pages 85-–91. ACM Press, 2017. Available here.
[carp17a] Maria Carpen-Amarie. Efficient Memory management with Hardware Transactional Memory: a Focus on Java Garbage Collectors and C++ Smart Pointers. PhD thesis, Université de Neuchâtel, 2017.
[cart89] A.M. Carter. Cascade: Hardware for high/variable precision arithmetic. In 9th Symposium on Computer Arithmetic, pages 184-191, Santa Monica, CA, September 1989. IEEE Press. Available here.
[case91] Brian Case. PA-RISC provides rich instruction set within RISC framework. Microprocessor Report, 5(6), April 1991.
[caud86] Patrick J. Caudill and Allen Wirfs-Brock. A third-generation Smalltalk-80 implementation. In OOPSLA 1986 [OOPSLA86], 1986, pages 119-130. Available here.
[CC00] 9th International Conference on Compiler Construction, volume 2027 of Lecture Notes in Computer Science, Berlin, April 2000. Springer-Verlag. Available here.
[CC01] 10th International Conference on Compiler Construction, volume 1781 of Lecture Notes in Computer Science, Genova, Italy, April 2001. Springer-Verlag.
[CC05] 14th International Conference on Compiler Construction, volume 3443 of Lecture Notes in Computer Science, Edinburgh, April 2005. Springer-Verlag. Available here.
[CC06] 15th International Conference on Compiler Construction, volume 3923 of Lecture Notes in Computer Science, Vienna, April 2006. Springer-Verlag.
[CC07] 16th International Conference on Compiler Construction, volume 4420 of Lecture Notes in Computer Science, Braga, Portugal, March 2007. Springer-Verlag. Available here.
[CC14] 23rd International Conference on Compiler Construction, volume 8409 of Lecture Notes in Computer Science, Grenoble, France, March 2014. Springer-Verlag.
[CC16] 25th International Conference on Compiler Construction, Barcelona, Spain, March 2016. ACM.
[cen20] Lujing Cen, Ryan Marcus, Hongzi Mao, Justin Gottschlich, Mohammad Alizadeh, and Tim Kraska. Learned garbage collection. In Proceedings of the 4th ACM SIGPLAN International Workshop on Machine Learning and Programming Languages (MAPL), pages 38-–44. ACM Press, 2020. Available here.
[cent92] CenterLine Software, Cambridge, MA. CodeCenter, The Programming Environment, 1992.
[CGO03] 1st International Symposium on Code Generation and Optimization (CGO), San Francisco, CA, March 2003. IEEE Computer Society Press.
[CGO04] 2nd International Symposium on Code Generation and Optimization (CGO), San Jose, CA, March 2004. IEEE Computer Society Press.
[CGO05] 3rd International Symposium on Code Generation and Optimization (CGO), San Jose, CA, March 2005. IEEE Computer Society Press.
[CGO06] 4th International Symposium on Code Generation and Optimization (CGO), New York, NY, March 2006. IEEE Computer Society Press.
[CGO07] 5th International Symposium on Code Generation and Optimization (CGO), San Jose, CA, March 2007. IEEE Computer Society Press.
[CGO08] 6th International Symposium on Code Generation and Optimization (CGO), Boston, MA, April 2008. ACM Press.
[CGO09] 7th International Symposium on Code Generation and Optimization (CGO), Seattle, WA, March 2009. IEEE Computer Society Press.
[CGO10] 8th International Symposium on Code Generation and Optimization (CGO), Toronto, Canada, April 2010. ACM Press.
[chai90] David Chaiken, Craig Fields, Kiyoshi Kurihara, and Anant Agarwal. Directory-based cache coherence in large-scale multiprocessors. IEEE Computer, 23(6):49-58, June 1990.
[chai84] Jérome Chailloux, Matthieu Devin, and Jean-Marie Hullot. Le\_Lisp: A portable and efficient Lisp system. In Steele [LFP84], 1984, pages 113-122. Available here.
[chai91] Emmanuel Chailloux. Compilation des Langages Fonctionnels: CeML un Traducteur ML vers C. PhD thesis, Université de Paris VII, November 1991.
[chai92] Emmanuel Chailloux. A conservative garbage collector with ambiguous roots for static typechecking languages. In Bekkers and Cohen [IWMM92], 1992, pages 218-229. Available here.
[chai92a] Emmanuel Chailloux. An efficient way of compiling ML to C. In David MacQueen, editor, ACM SIGPLAN Workshop on ML and its Applications, San Francisco. ACM Press, June 1992.
[cham89] Craig Chambers, David M. Ungar, and Elgin Lee. An efficient implementation of SELF, a dynamically-typed object-oriented language based on prototypes. In OOPSLA 1989 [OOPSLA89], 1989, pages 48-70. Available here.
[cham91] Craig Chambers, David M. Ungar, and Elgin Lee. An efficient implementation of SELF, a dynamically-typed object-oriented language based on prototypes. Lisp and Symbolic Computation, 4(3):243-281, 1991. Available here.
[cham89a] Craig Chambers and David M. Ungar. Customization: Optimizing compiler technology for Self, a dynamically-typed object-oriented language. In PLDI 1989 [PLDI89], 1989, pages 146-160. Available here.
[cham92] Craig Chambers. The Design and Implementation of the SELF Compiler, an Optimizing Compiler for an Objected-Oriented Programming Language. PhD thesis, Stanford University, March 1992.
[cham91a] Craig Chambers. Cost of garbage collection in the SELF system. In Moss et al. [OOPSLA93-gc], 1993. Available here.
[chan99a] J. Morris Chang, Woo Hyong Lee, and Yusuf Hasan. Measuring dynamic memory invocations in object-oriented programs. In 18th IEEE International Performance Conference on Computers and Communications, pages 268-274, Phoenix, AZ, February 1999.
[chan99] J. Morris Chang, Witiwas Srisa-an, and Chia-Tien Dan Lo. DMMX (dynamic memory management extensions): An introduction. In Workshop notes of ICCD workshop on Hardware Support for Objects and Microarchitectures for Java, pages 11-14, Austin, TX, October 1999.
[chan99b] J. Morris Chang, Witiwas Srisa-an, and Chia-Tien Dan Lo. OMeX: Object management extensions for embedded systems. In 2nd International Workshop on Compiler and Architecture Support for Embedded Systems, Washington, DC, October 1999.
[chan00d] J. Morris Chang, Yusuf Hasan, and Woo Hyong Lee. High-performance memory allocator for memory intensive applications. In 4th IEEE International Conference on High Performance Computing in Asia-Pacific Region, pages 6-12, Beijing, China, May 2000.
[chan00c] J. Morris Chang, Chia-Tien Dan Lo, and Edward F. Gehringer. Hardware support for dynamic memory management. In Workshop notes of ACM/IEEE International Symposium on Computer Architecture Workshop on Solving the Memory Wall Problem, Vancouver, June 2000.
[chan00e] J. Morris Chang, Witiwas Srisa-an, and C.D. Lo. Hardware support for concurrent garbage collection in SMP systems. In 4th IEEE International Conference on High Performance Computing in Asia-Pacific Region, pages 513-517, Beijing, China, May 2000.
[chan00b] J. Morris Chang, Witiwas Srisa-an, and Chia-Tien Dan Lo. Architectural support for dynamic memory management. In IEEE International Conference on Computer Design, pages 99-104, Austin, TX, September 2000. Available here.
[sris00c] J. Morris Chang, Witiwas Srisa-an, and Chia-Tien Dan Lo. Architectural support for dynamic memory management. In IEEE International Conference on Computer Design, pages 99-104, Austin, TX, September 2000.
[chan01] J. Morris Chang, W.H. Lee, and Witiwas Srisa-an. A study of the allocation behavior of C++ programs. Journal of Systems and Software, 2001. accepted for publication, Fall 2001.
[chan02] J. Morris Chang, Witawas Srisa-an, Chia-Tien Dan Lo, and Edward F. Gehringer. DMMX: Dynamic memory management extensions. Journal of Systems and Software, 63(3):187-199, September 2002. Available here.
[chan04] Li-Pin Chang, Tei-Wei Kuo, and Shi-Wu Lo. Real-time garbage collection for flash-memory storage systems of real-time embedded systems. ACM Transactions on Embedded Computer Systems, 3(4):837-863, November 2004. Available here.
[chan12] J. Morris Chang, Wei-Mei Chen, Paul A. Griffin, and Ho-Yuan Cheng. Cyclic reference counting by typed reference fields. Computer Languages, Systems & Structures, 38(1):98-107, 2012. Available here.
[chan00] J. Morris Chang and Charles H. Daugherty. An efficient data structure for dynamic memory management. Journal of Systems and Software, 54(3):219-226, November 2000. Available here.
[chan93] J. Morris Chang and Edward F. Gehringer. Evaluation of an object-caching coprocessor design for object-oriented systems. In International Conference on Computer Design, pages 132-139, Cambridge, MA, October 1993. IEEE Press. Available here.
[chan93a] J. Morris Chang and Edward F. Gehringer. Performance of object caching for object-oriented systems. In IFIP TC10/WG10.5 International Conference on Very Large Scale Integration, pages 83-91, Grenoble, France, September 1993.
[chan96] J. Morris Chang and Edward F. Gehringer. A high-performance memory allocator for object-oriented systems. IEEE Transactions on Computers, pages 357-366, March 1996.
[chan89] Ellis E. Chang and Randy H. Katz. Exploiting inheritance and structure semantics for effective clustering and buffering in an object-oriented DBMS. In SIGMOD 1989 [SIGMOD89], 1989, pages 348-357.
[chan02a] Li-Pin Chang and Tei-Wei Kuo. A real-time garbage collection mechanism for flash-memory storage systems in embedded systems. In RTCSA 2002 [RTCSA02], 2002. Available here.
[chan98] J. Morris Chang and Woo Hyong Lee. A study on memory allocations in C++. In 14th International Conference on Advanced Science and Technology, pages 53-62, Naperville, IL, April 1998.
[chan84] J. Chang and N.F. Maxemchuk. Reliable broadcast protocols. ACM Transactions on Computer Systems, 2:251-273, August 1984.
[chan05] Yang Chang and Andy J. Wellings. Integrating hybrid garbage collection with dual priority scheduling. In RTCSA 2005 [RTCSA05], 2005, pages 185-188. Available here.
[chan06a] Yang Chang and Andy J. Wellings. Hard real-time hybrid garbage collection with low memory requirements. In 27th IEEE Real-Time Systems Symposium, pages 77-86, December 2006. Available here.
[chan06] Yang Chang and Andy J. Wellings. Low memory overhead real-time garbage collection for Java. In 4th International Workshop on Java Technologies for Real-time and Embedded Systems, Paris, France, October 2006. Available here.
[chan10] Yang Chang and Andy J. Wellings. Garbage collection for flexible hard real-time systems. IEEE Transactions on Computers, 59(8):1063-1075, August 2010. Available here.
[chan97] J. Morris Chang. An optimized two-dimensional buddy system for dynamic resource allocation. Journal of High Performance Computing, 4(1):47-55, December 1997.
[chan05a] Yang Chang. Integrating hybrid garbage collection with dual priority scheduling. Technical Report YCS388(2005), University of York, 2005. Available here.
[chan06b] Yang Chang. Hard real-time hybrid garbage collection with low memory requirement. Technical report, University of York, 2006. Available here.
[chan07] Yang Chang. Garbage Collection for Flexible Hard Real-time Systems. PhD thesis, University of York, 2007.
[chan86] R.J. Chansler. Efficient Use of Systems with Many Processors. Number 6 in Computer science: computer architecture and design. University of Michigan Press, Ann Arbor, MI, 1986.
[chas90] David R. Chase, Wegman, and Zadeck. Analysis of pointers and structures. ACM SIGPLAN Notices, 25(6), 1990.
[chas92a] Jeffrey S. Chase, Henry M. Levy, Miche Baker-Harvey, and Edward D. Lazowska. How to use a 64-bit virtual address space. Technical Report 92-03-02, University of Washington, Seattle, WA, February 1992.
[chas92] Jeffrey S. Chase, Henry M. Levy, Edward D. Lazowska, and Miche Baker-Harvey. Lightweight shared objects in a 64-bit operating system. In OOPSLA 1992 [OOPSLA92], 1992. Available here.
[chas87] David R. Chase. Garbage Collection and Other Optimizations. PhD thesis, Rice University, August 1987. Available here.
[chas88] David R. Chase. Safety considerations for storage allocation optimizations. In PLDI 1988 [PLDI88], 1988, pages 1-10. Available here.
[thak15] Nachiketa Chatterjee, Saurabh Singh Thakur, and Partha Pratim Das. Resource management in native languages using dynamic binary instrumentation (PIN). In Advanced Computing and Systems for Security, volume 395 of Advances in Intelligent Systems and Computing, November 2015. Second International Doctoral Symposium on Applied Computation and Security Systems (ACSS 2015). Available here.
[chaw03] Sumit Chawla. Fine-tuning Java garbage collection performance: How to detect and troubleshoot garbage collection issues with the IBM Java virtual machine. IBM developerWorks, January 2003. Available here.
[chea00] Andrew M. Cheadle, Anthony J. Field, Simon Marlow, Simon L. Peyton Jones, and R.L While. Non-stop Haskell. In ICFP 2000 [ICFP00], 2000, pages 257-267. Available here.
[chea04] Andrew M. Cheadle, Anthony J. Field, Simon Marlow, Simon L. Peyton Jones, and Lyndon While. Exploring the barrier to entry - incremental generational garbage collection for Haskell. In Bacon and Diwan [ISMM04], 2004, pages 163-174. Available here.
[chea06] Andrew Cheadle, Tony Field, John Ayres, Neil Dunn, Richard Hayden, and Johan Nystrom-Persson. Visualising dynamic memory allocators. In Petrank and Moss [ISMM06], 2006, pages 115-125. Available here.
[chea08] A.M. Cheadle, A.J. Field, and J. Nyström-Persson. A method specialisation and virtualised execution environment for Java. In Gregg et al. [VEE08], 2008, pages 51-60. Available here.
[chen02c] Guangyu Chen, R. Shetty, Mahmut T. Kandemir, Narayanan Vijaykrishnan, Mary Jane Irwin, and Mario Wolczko. Influence of garbage collection on memory system energy. ACM Transactions on Embedded Computer Systems, 1(1), November 2002.
[chen02] Gungyu Chen, Mahmut T. Kandemir, Narayanan Vijaykrishnan, Mary Jane Irwin, and Mario Wolczko. Adaptive garbage collection for battery-operated environments. In JVM 2002 [JVM02], 2002, pages 1-12. Available here.
[chen02b] Gungyu Chen, R. Shetty, Mahmut T. Kandemir, Narayanan Vijaykrishnan, Mary Jane Irwin, and Mario Wolczko. Tuning garbage collection for reducing memory system energy in an embedded Java environment. ACM Transactions on Embedded Computer Systems, 1(1):6-26, November 2002. Available here.
[chen02a] Gungyu Chen, R. Shetty, Mahmut T. Kandemir, Narayanan Vijaykrishnan, Mary Jane Irwin, and Mario Wolczko. Tuning garbage collection in an embedded Java environment. In 8th Annual Symposium on High-Performance Computer Architecture, pages 92-103, Boston, MA, February 2002. IEEE Computer Society Press. Available here.
[chen03b] D. Chen, A. Messer, D. Milojicic, and S. Dwarkadas. Garbage collector assisted memory offloading for memory constrained devices. In 5th IEEE Workshop on Mobile Computing Systems and Applications. IEEE Press, 2003.
[chen03a] Guangyu Chen, Mahmut Kandemir, Naraya Vijaykrishnan, Mary Jane Irwin, Bernd Mathiske, and Mario Wolczko. Heap compression for memory-constrained Java environments. In OOPSLA 2003 [OOPSLA03], 2003, pages 282-301. Available here.
[chen04] Guangyu Chen, Mahmut Kandemir, Narayanan Vijaykrishnan, and Mary Jane Irwin. Field level analysis for heap space optimization in embedded Java environments. In Bacon and Diwan [ISMM04], 2004, pages 131-142. Available here.
[chen05] Guangyu Chen, Mahmut Kandemir, and Mary J. Irwin. Exploiting frequent field values in Java objects for reducing heap memory requirements. In Hind and Vitek [VEE05], 2005, pages 68-78. Available here.
[chen06] Wen-Ke Chen, Sanjay Bhansali, Trishul M. Chilimbi, Xiaofeng Gao, and Weihaw Chuang. Profile-guided proactive garbage collection for locality optimization. In Schwartzbach and Ball [PLDI06], 2006, pages 332-340. Available here.
[chen11] Kuo-Yi Chen, J. Morris Chang, and Ting-Wei Hou. Multithreading in Java: Performance and scalability on multicore systems. IEEE Transactions on Computers, 60(11), 2011. Available here.
[chen70] C.J. Cheney. A non-recursive list compacting algorithm. Communications of the ACM, 13(11):677-8, November 1970. Available here.
[chen98] Perry Cheng, Robert Harper, and Peter Lee. Generational stack collection and profile-driven pretenuring. In PLDI 1998 [PLDI98], 1998, pages 162-173. Available here.
[chen01] Perry Cheng and Guy Blelloch. A parallel, real-time garbage collector. In PLDI 2001 [PLDI01], 2001, pages 125-136. Available here.
[chen01a] Perry Sze-Din Cheng. Scalable Real-Time Parallel Garbage Collection for Symmetric Multiprocessors. PhD thesis, Carnegie Mellon University, September 2001. SCS Technical Report CMU-CS-01-174. Available here.
[cheo92] Fah-Chun Cheong. Almost tag-free garbage collection for strongly-typed object-oriented languages. Technical Report CSE-TR-126-92, University of Michigan, 1992.
[cher04a] Chen-Yong Cher, Antony L. Hosking, and T.N. Vijaykumar. Software prefetching for mark-sweep garbage collection: Hardware analysis and software redesign. In Mukherjee and McKinley [ASPLOS04], 2004, pages 199-210. Available here.
[cher08] C.-Y. Cher and M. Gschwind. Cell GC: Using the Cell synergistic processor as a garbage collection coprocessor. In Gregg et al. [VEE08], 2008. Available here.
[cher07] Sigmund Cherem, Lonnie Princehouse, and Radu Rugina. Practical memory leak detection using guarded value-flow analysis. In Ferrante and McKinley [PLDI07], 2007, pages 480-491. Available here.
[cher04] Sigmund Cherem and Radu Rugina. Region analysis and transformation for Java programs. In Bacon and Diwan [ISMM04], 2004, pages 85-96. Available here.
[cher06] Sigmund Cherem and Radu Rugina. Compile-time deallocation of individual objects. In Petrank and Moss [ISMM06], 2006, pages 138-149. Available here.
[cher07a] Sigmund Cherem and Radu Rugina. Uniqueness inference for compile-time object deallocation. In Morrisett and Sagiv [ISMM07], 2007, pages 117-128. Available here.
[chev02] K. Chevalier, J. Kodumal, and X. Jiang. Memory subsystem optimization for functional languages: A case study. Technical report, Computer Science Division, University of California, Berkeley, May 2002. Available here.
[chic06] Yannis Chicha and Stephen M. Watt. A localized tracing scheme applied to garbage collection. In Naoki Kobayashi, editor, 4th Asian Symposium on Programming Languages and Systems, volume 4279 of Lecture Notes in Computer Science, pages 323-349, Sydney, Australia, November 2006. Springer-Verlag. Available here.
[chic02] Yannis Chicha. Practical Aspects of Interacting Garbage Collectors. PhD thesis, University of Western Ontario, 2002.
[chih04] Irina Chihaia and Thomas Gross. An analytical model for software-only main memory compression. In 3rd Workshop on Memory Issues, pages 107-113, Munich, Germany, June 2004. ACM Press. Available here.
[chik87] T. Chikayama and Y. Kimura. Multiple reference management in Flat GHC. In 4th International Conference on Logic Programming, pages 276-293, 1987.
[chil99a] Trishul M. Chilimbi, Bob Davidson, and James R. Larus. Cache-conscious structure definition. In PLDI 1999 [PLDI99], 1999, pages 13-24. Available here.
[chil99] Trishul M. Chilimbi, Mark D. Hill, and James R. Larus. Cache-conscious structure layout. In PLDI 1999 [PLDI99], 1999, pages 1-12. Available here.
[chil00] Trishul Chilimbi, Richard E. Jones, and Benjamin Zorn. Designing a trace format for heap allocation events. In Chambers and Hosking [ISMM2000], 2000, pages 35-49. Available here.
[chil98] Trishul M. Chilimbi and James R. Larus. Using generational garbage collection to implement cache-conscious data placement. In Peyton~Jones and Jones [ISMM98], 1998, pages 37-48. Available here.
[chil01] Trishul M. Chilimbi. Efficient representations and abstractions for quantifying and exploiting data reference locality. In PLDI 2001 [PLDI01], 2001, pages 191-202. Available here.
[chin03] Wei-Ngan Chin, Florin Craciun, Shengchao Qin, and Martin Rinard. Region inference for an object-oriented language. Technical report, National University of Singapore, November 2003. Available here.
[chin04] Wei-Ngan Chin, Florin Craciun, Shengchao Qin, and Martin C. Rinard. Region inference for an object-oriented language. In Pugh and Chambers [PLDI04], 2004, pages 243-254. Available here.
[chin08] Wei-Ngan Chin, Huu Hai Nguyen, Corneliu Popeea, and Shengchao Qin. Analysing memory resource bounds for bytecode programs. In Jones and Blackburn [ISMM08], 2008, pages 151-160. Available here.
[chin92] Ramakrishna Chinta. Hardware-assisted garbage collection for the Icon programming language. Technical Report 92-39, Iowa State University, December 1992. Available here.
[chir92] Jawahar Chirimar, Carl A. Gunter, and Jon G. Riecke. Proving memory managemeont invariants for a language based on linear logic. In LFP 1992 [LFP92], 1992, pages 129-150. Available here.
[chir96] Jawahar Chirimar, Carl A. Gunter, and Jon G. Riecke. Reference counting as a computational interpretation of linear logic. Journal of Functional Programming, 6(2):195-244, March 1996.
[chis11] Adriana E. Chis, Nick Mitchell, Edith Schonberg, Gary Sevitsky, Patrick O'Sullivan, Trevor Parsons, and John Murphy. Patterns of memory inefficiency. In Mezini [ECOOP11], 2011, pages 383-407. Available here.
[chiu91] Tzi-cker Chiueh. An architectural technique for cache-level garbage collection. In Hughes [FPCA91], 1991, pages 520-537. Available here.
[cho06] Hyeonjoong Cho, Chewoo Na, Binoy Ravindran, and E. Douglas Jensen. On scheduling garbage collector in dynamic real-time systems with statistical timing assurances. In ISORC 2006 [ISORC06], 2006. Available here.
[cho07] Hyeonjoong Cho, Chewoo Na, Binoy Ravindran, and E. Douglas Jensen. On scheduling garbage collector in dynamic real-time systems with statistical timing assurances. Real-Time Systems, 36(1-2):23-46, 2007. Available here.
[cho07a] Hyeonjoong Cho, Binoy Ravindran, and Chewoo Na. Garbage collector scheduling in dynamic, multiprocessor real-time systems. IEEE Transactions on Parallel and Distributed Systems, 20(6):845-856, June 2009. Available here.
[choi99] Jong-Deok Choi, Manish Gupta, Mauricio Serrano, Vugranam C. Sreedhar, and Samuel Midkiff. Escape analysis for Java. In OOPSLA 1999 [OOPSLA99], 1999, pages 1-19. Available here.
[choi03] Jong-Deok Choi, Manish Gupta, Mauricio Serrano, Vugranam C. Sreedhar, and Samuel Midkiff. Stack allocation and synchronization options for Java using escape analysis. ACM Transactions on Programming Languages and Systems, 25(6):876-910, November 2003. Available here.
[choi05] Hyung-Kyu Choi, Yoo C. Chung, and Soo-Mook Moon. Java memory allocation with lazy worst fit for small objects. Computer Journal, 48(4):437-442, 2005. Available here.
[choi18] Jiho Choi, Thomas Shull, and Josep Torrellas. Biased reference counting: Minimizing atomic operations in garbage collection. In PACT 2018 [PACT18], 2018, page 12. Available here.
[chri98] M.V. Christiansen and P. Velschrow. Region-based memory management in Java. Master's thesis, Department of Computer Science (DIKU), University of Copenhagen, May 1998.
[chri10] Dave Christie, Jae-Woong Chung, Stephan Diestelhorst, Michael Hohmuth, Martin Pohlack, Christof Fetzer, Martin Nowack, Torvald Riegel, Pascal Felber, Patrick Marlier, and Etienne Riviere. Evaluation of AMD's Advanced Synchronization Facility within a complete transactional memory stack. In EuroSys 2010 [EuroSys10], 2010, pages 27-40. Available here.
[chri84] T.W. Christopher. Reference count garbage collection. Software: Practice and Experience, 14(6):503-507, June 1984.
[chun00] Yoo C. Chung, Soo-Mook Moon, Kemal Ebcioglu, and Dan Sahlin. Reducing sweep time for a nearly empty heap. In 27th Annual ACM SIGPLAN-SIGACT ACM SIGPLAN Symposium on Principles of Programming Languages (POPL '00), Boston, MA, January 2000. ACM Press.
[chun05] Yoo C. Chung, Soo-Mook Moon, Kemal Ebciolu, and Dan Sahlin. Selective sweeping. Software: Practice and Experience, 35(1):15-26, 2005. Available here.
[chun10] Jae-Woong Chung, Luke Yen, Stephan Diestelhorst, Martin Pohlack, Michael Hohmuth, David Christie, and Dan Grossman. ASF: AMD64 extension for lock-free data structures and transactional memory. In 43rd IEEE/ACM International Symposium on Microarchitecture, pages 39-50, Atlanta, GA, December 2010. Available here.
[chun00a] Yoo C. Chung and Soo-Mook Moon. Memory allocation with lazy fits. In Chambers and Hosking [ISMM2000], 2000, pages 65-70. Available here.
[ciep83] A. Ciepielewski and Seif Haridi. Storage models for Or-parallel execution of logic programs. Technical Report TRITA-CS-8301, Royal Institute of Technology, Stockholm, Sweden, 1983.
[cier03] Michal Cierniak, Marsha Eng, Neal Glew, Brian Lewis, and James Stichnoth. The Open Runtime Platform: A flexible high-performance managed runtime environment. Intel Technology Journal, 7(1):5-18, 2003. Available here.
[cier05] Michal Cierniak, Marsha Eng, Neal Glew, Brian Lewis, and James Stichnoth. The Open Runtime Platform: A flexible high-performance managed runtime environment. Concurrency and Computation: Practice and Experience, 17(5-6):617-637, 2005. Available here.
[clar77] Douglas W. Clark and C. Cordell Green. An empirical study of list structure in Lisp. Communications of the ACM, 20(2):78-86, February 1977. Available here.
[clar78b] Douglas W. Clark and C. Cordell Green. A note on shared list structure in Lisp. Information Processing Letters, 7(6):312-314, October 1978.
[clar75] Douglas W. Clark. A fast algorithm for copying binary trees. Information Processing Letters, 9(3):62-63, December 1975.
[clar76] Douglas W. Clark. An efficient list moving algorithm using constant workspace. Communications of the ACM, 19(6):352-354, June 1976.
[clar76a] Douglas W. Clark. List Structure: Measurements, Algorithms, and Encodings.. PhD thesis, Carnegie Mellon University, 1976. Available here.
[clar78a] Douglas W. Clark. A fast algorithm for copying list structures. Communications of the ACM, 21(5):351-357, May 1978.
[clar79] Douglas W. Clark. Measurements of dynamic list structure in Lisp. ACM Transactions on Software Engineering, 5(1):51-59, January 1979.
[clar96] Charles L.A. Clarke and Dave Mason. Compacting garbage collection can be fast and simple. Software: Practice and Experience, 26(2):177-194, February 1996. Available here.
[clar01] David Clarke. On deleting aggregate objects. In SPACE 2001 [SPACE01], 2001. Available here.
[cleb15] Sylvan Clebsch, Sebastian Blessing, Juliana Franco, and Sophia Drossopoulou. Ownership and reference counting based garbage collection in the actor world. In Morandat [ICOOOLPS15], 2015. Available here.
[cleb13] Sylvan Clebsch and Sophia Drossopoulou. Fully concurrent garbage collection of actors on many-core machines. In OOPSLA 2013 [OOPSLA13], 2013, pages 553-570. Available here.
[clic05] Cliff Click, Gil Tene, and Michael Wolf. The Pauseless GC algorithm. In Hind and Vitek [VEE05], 2005, pages 46-56. Available here.
[clic03] Cliff Click. Performance myths exposed. Talk at JavaOne 2003, 2003.
[clif14] Daniel Clifford, Hannes Payer, Michael Starzinger, and Ben L. Titzer. Allocation folding based on dominance. In Guyer and Grove [ISMM14], 2014, pages 15-24. Available here.
[clif15] Daniel Clifford, Hannes Payer, Michael Stanton, and Ben L. Titzer. Memento Mori: Dynamic allocation-site-based optimizations. In Bond and Hosking [ISMM15], 2015, pages 105-117. Available here.
[clin88] William D. Clinger, Anne Hartheimer, and Erik Ost. Implementation strategies for continuations. In LFP 1988 [LFP88], 1988, pages 124-131. Available here.
[clin97] William D. Clinger and Lars T. Hansen. Generational garbage collection and the radioactive decay model. In PLDI 1997 [PLDI97], 1997, pages 97-108. Available here.
[clin09] William D. Clinger and Felix S. Klock. Scalable garbage collection with guaranteed MMU. In Scheme and Functional Programming 2009, Boston, MA, August 2009. Available here.
[clin06] William D. Clinger and Fabio V. Rojas. Linear combinations of radioactive decay models for generational garbage collection. Science of Computer Programming, 62(2):184-203, October 2006. Available here.
[cobl22] Michael Coblenz, Michelle L. Mazurek, and Michael Hicks. Garbage collection makes Rust easier to use: A randomized controlled trial of the Bronze garbage collector. In ICSE 2022 [ICSE22], 2022, pages 1021-1032. Available here.
[cobu11] Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laura M. Grupp, Rajesh K. Gupta, Ranjit Jhala, and Steven Swanson. NV-Heaps: Making persistent objects fast and safe with next-generation, non-volatile memories. In Mowry [ASPLOS11], 2011, pages 105-118. Available here.
[cock84] W. Cockshott, Malcolm Atkinson, K. Chisholm, P. Bailey, and Ron Morrison. Persistent object management system. Software: Practice and Experience, 14(1):49-71, January 1984.
[code93] Codewright's Toolworks, San Pedro, CA. Alloc-GC: The Garbage Collecting Replacement for malloc(), 1993.
[coff85] E.G. Coffman, Jr., T.T. Kadota, and L.A. Shepp. On the asymptotic optimality of first-fit storage allocation. IEEE Transactions on Software Engineering, SE-11(2):235-239, February 1985.
[coff89] E.G. Coffman, Jr. and F.T. Leighton. A provably efficient algorithm for dynamic storage allocation. Journal of Computer and System Sciences, 38(1):2-35, February 1989.
[coff83] E.G. Coffman, Jr. An introduction to combinatorial models of dynamic storage allocation. SIAM Review, 25(3):311-325, July 1983.
[cohe06] M. Cohen, S. Kooi, and Witiwas Srisa-an. Clustering the heap in multi-threaded applications for improved garbage collection. In ACM Genetic and Evolutionary Computation Conference (GECCO), pages 1901-1908, Seattle, WA, July 2006. Available here.
[cohe83] Jacques Cohen and Alexandru Nicolau. Comparison of compacting algorithms for garbage collection. ACM Transactions on Programming Languages and Systems, 5(4):532-553, October 1983. Available here.
[cohe13] Nachshon Cohen and Erez Petrank. Limitations of partial compaction: Towards practical bounds. In PLDI 2013 [PLDI13], 2013. Available here.
[cohe15a] Nachshon Cohen and Erez Petrank. Automatic memory reclamation for lock-free data structures. In OOPSLA 2015 [OOPSLA15], 2015. Available here.
[cohe15] Nachshon Cohen and Erez Petrank. Data structure aware garbage collector. In Bond and Hosking [ISMM15], 2015, pages 28-40. Available here.
[cohe17] Nachshon Cohen and Erez Petrank. Limitations of partial compaction: Towards practical bounds. ACM Transactions on Programming Languages and Systems, 39(1):2:1-2:44, March 2017. Available here.
[cohe67b] Jacques Cohen and Laurent Trilling. Remarks on garbage collection using a two level storage. BIT, 7(1):22-30, 1967.
[cohe72] Jacques Cohen and C. Zuckerman. Evalquote in simple Fortran: A tutorial on interpreting Lisp. BIT, 12(3):299-317, 1972.
[cohe67a] Jacques Cohen. A use of fast and slow memories in list-processing languages. Communications of the ACM, 10(2):82-86, February 1967.
[cohe81] Jacques Cohen. Garbage collection of linked data structures. ACM Computing Surveys, 13(3):341-367, September 1981.
[cohe18] Nachshon Cohen. Every data structure deserves lock-free memory reclamation. In OOPSLA 2018 [OOPSLA18], 2018. Available here.
[cohn97] David Cohn and Satinder Singh. Predicting lifetimes in dynamically allocated memory. In M. Mozer et al., editors, Advances in Neural Information Processing Systems 9, 1997. Available here.
[coll60] George E. Collins. A method for overlapping and erasure of lists. Communications of the ACM, 3(12):655-657, December 1960. Available here.
[coll61] George E. Collins. Experience in automatic storage allocation. Communications of the ACM, 4(10):436-440, October 1961.
[coll65] George E. Collins. REFCO III, a reference count list processing system for the IBM 7094. Research Report RC-1436, IBM Corp., May 1965.
[coll06] Matthew Collinson and David Pym. Bunching for region and location models. In SPACE 2006 [SPACE06], 2006, pages 14-22. Available here.
[coln98] Dominique Colnet, Philippe Coucaud, and Olivier Zendra. Compiler support to customize the mark and sweep algorithm. In Peyton~Jones and Jones [ISMM98], 1998, pages 154-165. Available here.
[coln98a] Dominique Colnet, Olivier Zendra, and Philippe Coucaud. Using type inference to customize the garbage collector in an object-oriented language. the SmallEiffel compiler. Rapport de recherche, INRIA Lorraine, 1998. Available here.
[coln15] Dominique Colnet and Benoˆ}t Sonntag.Exploiting array manipulation habits to optimize garbage collection and type flow analysis. Software: Practice and Experience, 45(12):1639-–1657, December 2015. Available here.
[colv95] G. Colvin. Smart pointer for C++ garbage collection. C/C++ Users Journal, 12(12), December 1995.
[comf64] W.T. Comfort. Multiword list items. Communications of the ACM, 7(6):357-362, June 1964. Available here.
[conr74] W.R. Conrad. A compactifying garbage collector for ECL's non-homogenous heap. Research Report 2-74, Center for Research in Computing Technology, Harvard, February 1974.
[cook93a] Jonathan E. Cook, Alexander L. Wolf, and Benjamin G. Zorn. The design of a simulation system for persistent object storage management. Computer Science Technical Report CU-CS-647-93, University of Colorado, Campus Box 430, Boulder, CO 80309, March 1993. Available here.
[cook93] Jonathan E. Cook, Alexander L. Wolf, and Benjamin G. Zorn. The performance of partitioned garbage collection in object databases. Computer Science Technical Report CU-CS-653-93, University of Colorado, Campus Box 430, Boulder, CO 80309, June 1993. Available here.
[cook94] Jonathan E. Cook, Alexander L. Wolf, and Benjamin G. Zorn. Partition selection policies in object databases garbage collection. In Richard T. Snodgrass and Marianne Winslett, editors, ACM SIGMOD International Conference on Management of Data, volume 23(2), pages 317-382, Minneapolis, May 1994. ACM Press.
[cook96] Jonathan E. Cook, Artur Klauser, Alexander L. Wolf, and Benjamin G. Zorn. Semi-automatic, self-adaptive control of garbage collection rates in object databases. In H.V. Jagadish and Inderpal Singh Mumick, editors, ACM SIGMOD International Conference on Management of Data, pages 377-388, Montreal, Quebec, Canada, June 1996. {SIGMOD Record 25(2), June 1996.
[cook98] Jonathan E. Cook, Alexander L. Wolf, and Benjamin G. Zorn. A highly effective partition selection policy for object database garbage collection. IEEE Transactions on Knowledge and Data Engineering, 10(1):153-172, 1998.
[coop92] Eric Cooper, Scott Nettles, and Indira Subramanian. Improving the performance of SML garbage collection using application-specific virtual memory management. In LFP 1992 [LFP92], 1992, pages 43-52. Available here.
[coop13] Gregory H. Cooper, Arjun Guha, Sriram Krishnamurthi, Jay McCarthy, and Robert Bruce Findler. Teaching garbage collection without implementing compilers or interpreters. In ACM Special Interest Group on Computer Science Education (SIGCSE) 2013, 2013. Available here.
[harv98] Keith D. Cooper and Timothy J. Harvey. Compiler-controlled memory. In ASPLOS 1998 [ASPLOS98], 1998, pages 2-11. Available here.
[copl92] James Coplien. Advanced C++ Programming Styles and Idioms. Addison-Wesley, 1992.
[corp88] H. Corporaal, T. Veldman, and A.J. van de Goor. Reference weight-based garbage collection for distributed systems. In SION Conference on Computing Science in the Netherlands, Utrecht, November 1988.
[corp90] H. Corporaal, T. Veldman, and A.J. van de Goor. Efficient, reference weight-based garbage collection method for distributed systems.. In PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications, pages 463-465, Miami Beach, 7-9 March 1990. IEEE Press.
[corp89] H. Corporaal. Garbage collection in distributed systems.. Internal report, Technical University, Delft, 1989.
[corr21] Andreia Correia, Pedro Ramalhete, and Pascal Felber. OrcGC: Automatic lock-free memory reclamation. In PPOPP 2021 [PPoPP21], 2021, page 205–218. Available here.
[corr06] Erik Corry. Optimistic stack allocation for Java-like languages. In Petrank and Moss [ISMM06], 2006, pages 162-173. Available here.
[cour86] Anthony J. Courtemanche. MultiTrash, a parallel garbage collector for MultiScheme. Bachelor's thesis, MIT Press, January 1986.
[cour88] Robert Courts. Improving locality of reference in a garbage-collecting memory management-system. Communications of the ACM, 31(9):1128-1138, 1988.
[couv89] André Couvert, Aomar Maddi, and René Pedrono. Partage d'objets dans les systè;mes distribués. principes des ramasse-miettes. Rapport de recherche 963, Institut National de la Recherche en Informatique et Automatique (INRIA), January 1989.
[crac08] Silviu S. Craciunas, Christoph M. Kirsch, Hannes Payer, Ana Sokolova, Horst Stadler, and Robert Staudinger. A compacting real-time memory management system. In USENIX Annual Technical Conference, pages 349-362, Boston, MA, 2008. Available here.
[crac14] Silviu S. Craciunas, Christoph M. Kirsch, Hannes Payer, Harald Röck, and Ana Sokolova. Concurrency and scalability versus fragmentation and compaction with compact-fit. http://de.arxiv.org/pdf/1404.1830, April 2014.
[cram95] Jim Crammond and Tim Lindholm. Memory management in Quintus Prolog. In Kluwer, editor, Implementations of Logic Programming Systems, Budapest, 1995.
[cram88] Jim Crammond. A garbage collection algorithm for shared memory parallel processors. International Journal Of Parallel Programming, 17(6):497-522, 1988. Available here.
[cran75] B. Cranston and R. Thomas. A simplified recombination scheme for the Fibonacci buddy system. Communications of the ACM, 18(6):331-332, July 1975.
[crar98] Karl Crary, David Walker, and Greg Morrisett. Typed memory management in a calculus of capabilities. Technical report, Cornell University, July 1998. Available here.
[crar99] Karl Crary, David Walker, and Greg Morrisett. Typed memory management in a calculus of capabilities. In POPL 1999 [POPL99], 1999. Available here.
[craw91] S.C. Crawley. Local and global distributed garbage collection. In Wilson and Hayes [OOPSLA91-gc], 1991. Available here.
[crid92] Regis Cridlig. An optimising ML to C compiler. In David MacQueen, editor, ACM SIGPLAN Workshop on ML and its Applications, San Francisco, June 1992. ACM Press.
[crit92] Terence J. Critchlow. A distributed garbage collection algorithm. Master's thesis, Department of Computer Science, University of Utah, August 1992. University of Utah Technical report CSTD-92-011. Available here.
[cron19] Karl Cronburg and Samuel Z. Guyer. Floorplan: Spatial layout in memory management systems. https://arxiv.org/pdf/1909.05339.pdf, September 2019. Available here.
[cron21] Karl Cronburg and Samuel Z. Guyer. Permchecker: A toolchain for debugging memory managers with typestate. In OOPSLA 2021 [OOPSLA21], 2021. Available here.
[saha16] Veysel Harun Şahin and Ümit Kocabiçak. A switchable approach to large object allocation in real-time Java. Turkish Journal of Electrical Engineering and Computer Sciences, 24:398-411, January 2016. Available here.
[curi08] Stephen Curial, Peng Zhao, Jose Nelson Amaral, Yaoqing Gao, Shimin Cui, Raul Silvera, and Roch Archambault. Memory pooling assisted data splitting (MPADS). In Jones and Blackburn [ISMM08], 2008, pages 101-110. Available here.
[cutl15] Cody Cutler and Robert Morris. Reducing pause times with clustered collection. In Bond and Hosking [ISMM15], 2015, pages 131-142. Available here.