Explore >> Select a destination
|
You are here 
|
emptysqua.re | ||
| | | | |
decomposition.al
|
|
| | | | | by Devashish Purandare ยท edited by Sohum Banerjea and Lindsey Kuper | |
| | | | |
www.openlife.cc
|
|
| | | | | This is just a "note to self" or cheatsheet... I'm working on the new distributed consensus algorithm about to appear in Cassandra 5.0. I see that I frequently lose momentum when I have to resort to the formal definition of the algorithm. Because I was never good at reading mathematical notation with a lot of greek letters... So, let's translate the greek letters to English words: | |
| | | | |
bytepawn.com
|
|
| | | | | This article examines where Lamport's original oral-messages Byzantine Generals algorithm does and does not apply in practice, contrasting unsuitable cases like distributed databases and rocket launches with a suitable case in redundant flight control systems. | |
| | | | |
sookocheff.com
|
|
| | | The Kubernetes sweet-spot is running stateless microservices that can scale horizontally. By keeping state out of your application, Kubernetes can seamlessly add, remove, or restart pods to keep your service healthy and scalable. Developing a stateless application is, without question, the easiest way to ensure that your app can scale with Kubernetes. However, there are some workloads that do not run effectively in a stateless way, and for that, Kubernetes offers a few tools for developing stateful applications: leader election, StatefulSets and session affinity. | ||
