Conflict-free replicated data types

By now everybody who has ever worked on a distributed system has heard of the CAP theorem. Simply put, it states that you have to choose between being (C)onsistent or being (A)vailable. The P, standing for Partition tolerant, is not really a choice for a distributed system (e.g. see the number 1 fallacy of distributed programming). So that leaves us in a peculiar state: … Lees verder Conflict-free replicated data types

Forward compatible messaging

If you have services or domains in your architecture, you probably have them to be able to develop them independently. In most cases, Message Queue’s are used to communicate between these services. But how does this work if one service upgrades the messages it is sending while the consuming services are still on an older version? In this blog post, we’ll … Lees verder Forward compatible messaging