Be the first to like this
How do you survive failure? You distribute. But distributed systems are distressingly complicated, everything from PAXOS to RAFT. Can we do better? Can we simplify things while still achieving reasonable results? This talk will explore a new method for conflict resolution that has been in the works for 5 years of R&D, and promises to mathematically ease the pain. All work is open source and has been implemented in the GUN database, a VC backed startup. We'll demonstrate some amazing recoveries from harsh failures and go into detail about how the fully peer-to-peer distributed algorithm works. We'll also discuss its weaknesses, where it fits in the CAP Theorem, and how it can be used as a building block for higher level consistency guarantees. You'll come out of the talk with a fresh perspective on concurrency that will help you make better decisions for your company's tough distributed problems. Ones based on mathematics and science, not hype of buzz words and marketing.