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 – Allocation
Reading Time: 3 minutesUp until now, we were concentrating on two aspects of the memory management – identifying live data, and a way to free unused memory. This post will concentrate on possibly the most important thing in memory management – allocating the memory. Two types of allocation There are two simple types of allocation – sequential and
Garbage collection theory – Copying algorithm
Reading Time: 6 minutesThe last ‘main’ of the GC algorithms that I’ve mentioned in the first post, was copying algorithm. The time has come then to dedicate a separate article to it. Basics of copying Algorithms already described suffer either from their execution time length, or resulting memory fragmentation. Copying GC algorithms are trying to address these issues,
Garbage collection theory – Mark&compact
Reading Time: 10 minutesUp until know, in the previous posts, we’ve taken a look at how memory is retrieved by different GC methods. However, we did not look at the state, in which the memory is left after such process. Obviously this is a big deal – no matter how fast GC algorithm is, when it leaves memory
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
Monthly summary #4
Reading Time: 2 minutesThat was a real rollercoaster for me this month. I went from passing certs, through the actual flood during my holidays, to slow recuperation at home with long-standing to-do reading. Here’s a short monthly summary of what I have done in September. Monthly summary AWS I have covered this topic extensively in the previous monthly
Monthly summary #3
Reading Time: 4 minutesSummer is behind us. However, I did not stay idle during the last month for sure – a lot has happened, and here’s a monthly summary of everything I have done in August. Monthly summary AWS The main area of interest was still AWS Associate Dev cert – with the official course finished, I have resorted to