GC Theory – mark&sweep algorithm

Mark&sweep was already mentioned in the previous posts. It is a cornerstone of all the marking algorithms, and is used as a backup for cyclic data structures in the ref counting. The time has come then to take a deeper look at it. Basics of…

Read more

GC Theory – Reference counting explained

Reference counting is one of its kind GC algorithm. I’ve covered it briefly in the introductory post about GC theory. In this article, we’ll dive into it deeper. Let’s go! How to deal with ref-counting deficiencies? There are two main problems with ref-counting algorithms. First,…

Read more

GC Theory – Basic algorithms

In the world of garbage collection, there are three algorithms, that are the founding stone for all the other. In this article I will try to briefly introduce all of them – reference counting algorithm, mark-sweep and copying algorithm. More detailed articles about them will…

Read more

Back to top