The graph at the bottom shows that lock-free algorithm is much better if the number of threads in the program is much more than the actual number of cores.
Metalbird
Also from the bottom graph we are able to see that there is a large incentive for using lock free algorithms for some types of problems. By using a lock free linked list implementation the authors were able to see significant benefits over using the pthreads-mutex lock or by using fine grained locking. However, depending on the number of threads and the implementation, there may be other methods that are able to perform better, but in general it appears at least from these results that lock free methods perform well on problems with a large numbers of threads.
The graph at the bottom shows that lock-free algorithm is much better if the number of threads in the program is much more than the actual number of cores.
Also from the bottom graph we are able to see that there is a large incentive for using lock free algorithms for some types of problems. By using a lock free linked list implementation the authors were able to see significant benefits over using the pthreads-mutex lock or by using fine grained locking. However, depending on the number of threads and the implementation, there may be other methods that are able to perform better, but in general it appears at least from these results that lock free methods perform well on problems with a large numbers of threads.