Distributed Mutual Exclusion using Proposed Boost.AFIO
summary
Shows a distributed mutual exclusion implementation built on atomic file-append messaging and a modified Maekawa–Suzuki–Kasami voting/consensus algorithm, using the proposed Boost.AFIO portable asynchronous filesystem API. Compares this append-based approach to lock files and byte-range locking with empirical benchmarks across NTFS, ReFS, ext4 and ZFS, and explains why the algorithm works well over SMB and mixed POSIX/Windows endpoints.
AI-written summary · about
chapters (5)
- 0:00Start
- 22:28shared mutex abstract base class
- 31:09File system concurrency primitives
- 46:42Atomic append lock algorithm
- 50:49Lamport's Bakery algorithm
related talks
42mReader-Writer Lock versus Mutex - Understanding a Lost Bet
01h 14m“C++ atomics, from basic to advanced. What do they really do?”
55m “High Performance C++ Concurrent Transactional Data Structures"
01h 22mBeyond Sequential Consistency - Leveraging Atomics for Fun & Profit
43mWhen Atomics Lose - Architecture‑Dependent Performance of C++ Synchronization
01h 03mSafety: off --- How not to shoot yourself in the foot with C++ atomics
01h 32mLock-free programming with modern C++
26mTackling Contention: The Monsters Inside the 'sync.Locker'