Jump to content

Talk:Lock-free and wait-free algorithms

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Requesting a merge with non-blocking synchronization, due to the fact that:

  • non-blocking sync is the more general topic
  • obstruction-freedom is also a non-blocking property and isn't covered in this article
  • wait-free and lock-free are two different concepts, but both are non-blocking, hence it would makes only sense to a) merge with non-blocking or b)generate two articles one on wait-free algos and one for lock-free (and of course one for obstruction-free algos)

Rattusdatorum 15:00, 16 January 2007 (UTC)[reply]

Discussion moved to Talk:Non-blocking synchronization, as that's the target page.

What is meant by "the data structure is updated in a purely functional way"? I think this could be clearer Mdz (talk) 13:51, 16 June 2008 (UTC)[reply]