CompuTruthing

At this point, I’m decided to pass most of my articles to Overload. I still have the freedom to talk about the topics that are close to my heart, but I also get all the benefits of publishing in a peer-reviewed journal. I highly appreciate the high-quality feedback coming from the reviewers, and the professionalism of all involved. Respect!

This article is proof that one can achieve high speedups by using task-based concurrency rather than locks. I personally was delighted with the results after working our the formulas.

read more

Another article I wrote appears in Overload: Deconstructing Inheritance.

The article tries to perform a critique of Inheritance as it is present in mainstream OOP. We look from multiple points of views on the Inheritance relationship, and we show that, at a closer inspection, it doesn’t reach up to the promises it makes. The article touches the simple problem of the Rectangle and Square, it discusses the parallel with the is-a relationship, and it shows how the Liskov Substitution Principle runs against inheritance.

read more

You have an application. You add threads to improve throughput. But how many threads do you add? Do you go for a fixed number, or you compute this dynamically?

We try to articulate an answer in this post.

read more

A new article of mine appeared in Overload: OOP Is not Essential.

Starting from a tweet from Grady Booch, the article claims that OOP is not essential in building (complex) software systems. It covers multiple meanings of the word “essential”, and it also covers the features of OOP and shows that there is nothing essential in there. The true weapon of fighting complexity is decomposition, but OOP isn’t the only alternative there.

read more

Long time, no post. Partially I was busy with other projects, but for a brief time, I was busy writing an article for ACCU. And, as you might have guessed, the article was called “Do Repeat Yourself”.

read more