A comparison of three garbage collection algorithms

    Research output: Contribution to journalArticleAcademicpeer-review

    28 Downloads (Pure)


    Abstract. The running cost of garbage collection is studied as a function of the amount of available store. A performance model originally proposed by Hoare is modified to support experiments with three garbage collection methods: reference count, mark/scan and two-space copy. By also taking the boundary effects into account, we show that adding more store to a list processing system with a non-reference counting garbagecollector does not always make it run faster. We present an explanation for this anomaly in the behaviour of garbage collection algorithms and discuss some of its consequences.
    Original languageUndefined
    Pages (from-to)117-128
    Number of pages12
    JournalStructured programming
    Issue number117
    Publication statusPublished - 1990


    • EWI-1224
    • IR-56006

    Cite this