Monday, September 11, 2023

How to (not) invent concurrent algorithms

›
Today I want to talk about correctness and the creative process of designing algorithms. Let's start with the later.   A couple ...
Friday, December 24, 2021

The importance of Correctness in concurrent algorithms

›
My work is in the area of concurrent algorithms therefore, this post is going to be largely biased by my experience in this field. Having sa...
Friday, March 12, 2021

The 4 laws of Durability

›
When it comes to having durable data, there are four ways to do it: undo log , redo log , shadow copy and shadow data .   Let's sta...
Friday, October 2, 2020

A Relaxed Guide do memory_order_relaxed

›
 Just a quick post to a nice presentation on relaxed atomics by Hans Boehm and Paul McKenney https://www.youtube.com/watch?v=cWkUqK71DZ0 Ver...
Wednesday, July 1, 2020

HydraConf 2020

›
The Hydra Conference is almost here again: https://hydraconf.com/ This year the speaker lineup is even more impressive: https://hydraconf.co...
Friday, June 12, 2020

You say read-committed, I say buggy-code, potatoe, potato, tomatoe, tomato

›
If I were to make a concurrent map data structure whose operations are not linearizable and then put it on a library and give it to my user...
11 comments:
Sunday, May 17, 2020

Dealing with bugs in Concurrency and Durability

›
Everyone knows that Concurrency is hard, in fact, it's NP-hard : the total number of interleavings typically grow exponentially with the...
1 comment: