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
Valuable links #47 – Java annotation processing explained (with samples)
Reading Time: < 1 minute
Review of “Writing for developers” by Piotr Sarna and Cynthia Dunlop
Reading Time: 5 minutesMe: Hello. My name is Michał and I have been writing for the last 17 years. My WA (writer’s anonymous) group: Hello Michał! Blogging is something really weird at its core. It’s a combination of ego pumping, honest pay-it-forward acts and both teaching and learning tool. At least that’s how I see it. Obviously, nowadays
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
Valuable links #46 – History and future of the microprocessors
Reading Time: < 1 minute
Review of “Refactoring at scale” by Maude Lemaire
Reading Time: 3 minutesMy main area of expertise in my everyday work is actually cleaning 😉 And no, it’s not Tony Soprano style of cleaning, but working on making the codebase better. I really enjoy refactoring, applying good practices, and seeing Sonar stats going up. Therefore, when I saw the title ‘Refactoring at scale’ I was both interested
Review of “High Performance MySQL”
Reading Time: 3 minutesDB-related knowledge in the current age seems to be polarized. On the one hand, ORMs’ (and other similar solutions) creators are trying to abstract away as much as possible. On the other hand – we have very specific use cases, where in-depth knowledge of DB configuration and performance is crucial. ‘High Performance MySQL’ is a