Introduction to Wait-free Algorithms in C++ Programming - Daniel Anderson - CppCon 2024 - YouTube
youtube.com · 11,180 words · saved by 1 readers
Follow along using the transcript. Follow along using the transcript. New New New New New New New New New New New New New New
https://cppcon.org --- Introduction to Wait-free Algorithms in C++ Programming - Daniel Anderson - CppCon 2024 --- If you've attended any talks about concurrency, you've no doubt heard the term "lock-free programming" or "lock-free algorithms". Usually these talks will give you a slide that explains vaguely what this means, but you accept that is is approximately (but not quite exactly) equal to "just don't use locks". More formally, lock-freedom is about guaranteeing how much progress your algorithm will make in a given time. Specifically, a lock-free algorithm will always make some…
saved by
related reading
- Multi Core Programming and Threadsimomath.com
- code::dive 2016 conference – Sean Parent – Better Code: Concurrencyyoutube.com
- Non-blocking algorithm - Wikipediaen.wikipedia.org
- A Concurrency Cost Hierarchytravisdowns.github.io
- Competitive Programmer's Handbookcses.fi
- notes.pdfstudent.cs.uwaterloo.ca
- Reading 16: Mutual Exclusionweb.mit.edu
- Girls Just Wanna Have Fast MPMC Queues with bounded waiting · Nahlanahla.dev
- Swift Concurrency Waits for No Onesaagarjha.com
- How to do distributed locking - Martin Kleppmann's blogmartin.kleppmann.com
- What the heck is the event loop anyway? | Philip Roberts | JSConf EUyoutube.com
- CppCon 2019: Arthur O'Dwyer “Back to Basics: Smart Pointers”youtube.com