Examples/Illustration of Wait-free And Lock-free Algorithms
问题 I've read that wait-free causes all threads to finish independently and lock-free ensures the program as a whole completes. I couldn't quite get it. Can anyone give an example (java) illustrating this. EDIT: Does lock-free mean a program without deadlock? 回答1: If a program is lock-free, it basically means that at least one of its threads is guaranteed to make progress over an arbitrary period of time. If a program deadlocks, none of its threads (and therefore the program as a whole) cannot