An algorithm is considered non-blocking if failure or suspension of any thread does not cause failure or suspension of another thread. Lock-free algorithms guarantee system-wide progress, while wait-free algorithms guarantee per-thread progress. The term "non-blocking" was originally used to describe telecommunications networks before being applied to computer science in 2003.
Stanford University
Fall 2022
Focused on principles and trade-offs in designing modern parallel computing systems, this course also teaches parallel programming techniques. It is intended for students looking to understand both parallel hardware and software design. Prerequisite knowledge in computer systems is required.
No concepts data
+ 45 more concepts