# Comparative Analysis of Classic Garbage-Collection Algorithms for a Lisp-like Language

**Authors:** Tyler Hannan, Chester Holtz, Jonathan Liao  
**arXiv:** [1505.00017](https://arxiv.org/abs/1505.00017)  
**Date:** 2015-04-30  
**Summary page:** https://www.summarizepaper.com/en/arxiv-id/1505.00017v1/

## Key points

- The paper investigates the effectiveness of Cheney's Copy Algorithm for a Lisp-like system
- The authors compare several garbage-collection algorithms, including Cheney's Algorithm, Mark and Sweep Algorithm, and Knuth's Classical Lisp 2 Algorithm
- The analysis is conducted within a custom MicroLisp environment
- Cheney's algorithm is found to be more effective than Mark-Sweep in terms of memory management in Lisp-like languages
- The research contributes to our understanding of garbage-collection algorithms in Lisp-like languages
- Valuable insights are provided into optimizing memory management in such systems

## Summary

In the paper "Comparative Analysis of Classic Garbage-Collection Algorithms for a Lisp-like Language," Tyler Hannan, Chester Holtz, and Jonathan Liao investigate the effectiveness of Cheney's Copy Algorithm for a Lisp-like system. They also explore the feasibility of developing an optimal garbage collector for general use. The authors summarize and compare several garbage-collection algorithms, including Cheney's Algorithm, the canonical Mark and Sweep Algorithm, and Knuth's Classical Lisp 2 Algorithm. To conduct their analysis, the authors implement and analyze these three algorithms within a custom MicroLisp environment. They aim to provide a comprehensive understanding of the core considerations behind the development of a garbage collector specifically designed for Lisp. The paper presents experimental results that demonstrate how Cheney's algorithm is more effective than Mark-Sweep in terms of memory management in Lisp-like languages. The authors discuss these findings in depth and highlight their implications for garbage collection in Lisp systems. Overall, this research contributes to our understanding of garbage-collection algorithms in Lisp-like languages and provides valuable insights into optimizing memory management in such systems.