Jump to content

Talk:Raymond's algorithm

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.

I think this should definitely mention that the root of the tree varies - it is always located at the token. Here is a decent summary of the algorithm: http://courseweb.sp.cs.cmu.edu/~cs498/spring2005/applications/ln/lecture14.html 141.218.144.34 (talk) 16:15, 10 November 2008 (UTC)[reply]

May be notable. 21 hits on Google Scholar exact phrase search. --Coppertwig (talk) 23:03, 21 November 2007 (UTC)[reply]

Notability

Raymond's Mutual Exclusion algorithm is certainly notable. Its an important foundational algorithm for distributed systems. The algorithm, along with Suzuki-Kasami's Broadcast Algorithm, is discussed in many Computer Science textbooks on distributed systems. Xeyedjack (talk) 22:18, 2 April 2008 (UTC)[reply]