Secrets of high performance in multicore systems ☠️
summary
Covers techniques for achieving high performance on multicore systems in Go by sharding atomic variables and maps, using algorithms like biased locking for reader-writer locks, and applying optimistic reads where appropriate. The talk explains when and why to shard shared state and when to prefer biased locks or optimistic-read strategies to reduce contention.
AI-written summary · about
chapters (7)
- 0:00Introduction
- 1:17Atomic operations and MESI
- 17:04Testing atomic operations
- 27:36Optimizing map usage
- 32:38Mutexes and Bravo algorithm
- 41:40Summary
- 42:49Q&A
related talks
52mSecrets of High Performance in Multicore Systems ☠️
39mLet's talk concurrency
48m“Is Parallel Programming still hard? PART 2 of 2”
26mTackling Contention: The Monsters Inside the 'sync.Locker'
44mConcurrency in Go: from hardware to code ☠️
36mThe FIDS Theorems: Tensions between Multinode and Multicore Performance in Transactional Systems
07mRace Conditions in Details
04mThe monsters inside the sync.Locker