I’ve been looking at synchronization-related concepts lately. It’s been really nice to revisit some ideas/concepts from my PhD years (e.g. consistency models for shared data in distributed environments). ‘Optimistic concurrency’ is a term I’ve encountered a lot and I just read the “Optimistic concurrency – a false panacea” post by Yaro Goland (via Mark Baker). Interesting!
I am not going to try to disagree with the arguments since I am just learning this area and I don’t have the much needed real world experience 🙂 However, I would like to point out that I’ve encountered systems where optimistic concurrency works relatively well (always apply the right tool for the right job!). A couple of examples come in mind: Active Directory and Windows Server Distributed File System. Granted, these are not transactions systems but they do optimistically propagate updates given their multi-owner nature for shared data. Perhaps I am not comparing similar things.
A good paper to read is “Optimistic Replication” by Saito and Shapiro.
Last week, I wrote about the evolution of the CVOYA Graph. After a lot of…
Last year, I released the "Graph Model" library for .NET as an open source project. It…
Today I'm pushing Spring Voyage out of the harbor. You can track its journey on…
In my last post, I wrote that "the typing of code was parallelized and delegated.…
In February, I wrote about the small team I'd stood up instead of hiring humans:…
Assembling a dream team without a single hire I've been making great progress on CVOYA's…