java.util.concurrent for Distributed Coordination

on YouTube ↗47m

" summary

Explains how Hazelcast implements distributed versions of java.util.concurrent primitives (locks, semaphores and similar) by building them on the Raft consensus algorithm. Shows code examples and discusses using these Java concurrency APIs for coordination tasks (leader election, locking, synchronized actions) in distributed environments that include partial failures.

AI-written summary · about

" chapters (5)

1. 0:00Start
2. 3:08Distributed Coordination Leader election Synchronization Group membership Configuration and metadata management
3. 11:55Concurrency Nondeterminism Partial failures
4. 19:02Replicated State Machines A leader is elected among the nodes. The leader replicates ops to the followers All nodes run the ops in the same order
5. 44:20Recap Avoid writing your own implementations for coordination High-level APIs minimise guesswork and development effort java.util.concurrent.. FTW Operational simplicity matters. Dynamic clustering

" related talks

• 45mjava.util.concurrent for Distributed CoordinationEnsar Basri Kahveci · GeeCON 2019
• 41mWhat can go wrong with the distributed system - the Hazelcast exp...Andrii Rodionov · GeeCON 2023
• 46mWhat can go wrong in a distributed system - experience from...Andrii Rodionov · GeeCON Prague 2023
• 48mHow to build distributed concurrency primitivesAndrii Rodionov · GeeCON 2024
• 30mDistributed Computing with HazelcastMurat Ayan, Bilal Yaşar · JavaDay Kyiv 2015
• 59mDistributed applications using HazelcastTaras Matyashovskyy · JavaDay Kiev 2014
• 55mHazelcast - Hitchhiker’s Guide. Grzegorz Piwowarek. Java Fest 2020 OnlineGrzegorz Piwowarek · Java Fest 2020
• 51mDo Not Reimplement Distributed Consensus AlgorithmsAlex B, Mykyta P, Vadym K · Devnexus 2023