Garbage collection theory – Generational algorithms
Reading Time: 7 minutesAs a Java programmer, the idea of GC is not new to me. However, as long as I remember, the concept of GC in Java was tightly coupled with Java Memory Model and its generational hypothesis. It reached the point where I actually could put an equal sign between JMM and GC process. Of course,
Garbage collection theory – Mark&sweep
Reading Time: 10 minutesMark&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 mark&sweep To remind us what we’re discussing here – mark&sweep
Garbage collection theory – Reference counting
Reading Time: 9 minutesReference 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, it has problems with cyclic objects, resulting in possible memory
Garbage collection theory – Basic Algorithms
Reading Time: 5 minutesIn 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 follow in the weeks to come. The reference counting algorithm
