✳flâneur — a map of the web's best reading
Non-blocking_algorithm
en.wikipedia.org · 2,612 words · saved by 1 readers
Couldn't find lead section for Non-blocking_algorithm
Non-blocking algorithm - Wikipedia Jump to content From Wikipedia, the free encyclopedia Algorithm in a thread whose failure cannot cause another thread to fail Not to be confused with Non-blocking I/O . In computer science , an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread; [ 1 ] for some operations, these algorithms provide a useful alternative to traditional blocking implementations . A non-blocking algorithm is lock-free if there is guaranteed system-wide progress , and wait-free if there is also guaranteed per-
Explore this link on the map →related reading
- Locking in WebKit | WebKitwebkit.org
- LittleBookOfSemaphores.pdfgreenteapress.com
- Understanding and expressing scalable concurrencyaturon.github.io
- Algorithms for Modern Hardware - Algorithmicaen.algorithmica.org
- Banker's algorithm - Wikipediaen.wikipedia.org
- How to do distributed locking - Martin Kleppmann's blogmartin.kleppmann.com
- Reading 16: Mutual Exclusionweb.mit.edu
- Blocking and Nonblocking IO in Operating System - GeeksforGeeksgeeksforgeeks.org
- Concurrent computing - Wikipediaen.wikipedia.org
- Memory Barriers Are Like Source Control Operationspreshing.com
- Introduction to Real-time Systemsdesign.ros2.org
- The Writings of Leslie Lamportlamport.azurewebsites.net