Valuable links #50 – Confessions of an Impostor
Reading Time: < 1 minute
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
Valuable links #48 – What we got good, and what wrong in Golang
Reading Time: < 1 minute
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,
My GOlang learning ANKI deck
Reading Time: < 1 minuteAt my new job I am using quite a lot of GO. It’s an interesting language, but as every programming language it does not just get into your head. One must learn and study. And that’s what I did. I won’t be going into much details about the whole learning process in general. That’s a
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