For Approval: Boost Software License - Version 1.0 - August 17th, 2003

[Alexander Terekhov]

On 10/11/07, Rick Moen <rick at linuxmafia.com> wrote:
[...]
>  FWIW, I have not known Mr.
> Terekhov to provide useful input.

Ha! I love you too, Rick.

(And Russ' speaking about algorithms.)

http://gee.cs.oswego.edu/dl/classes/EDU/oswego/cs/dl/util/concurrent/FIFOReadWriteLock.java

/*
  File: FIFOReadWriteLock.java

  Originally written by Doug Lea and released into the public domain.
  This may be used for any purposes whatsoever without acknowledgment.
  Thanks for the assistance and support of Sun Microsystems Labs,
  and everyone contributing, testing, and using this code.

  History:
  Date       Who                What
  11Jun1998  dl               Create public version
  23nov2001  dl               Replace main algorithm with fairer
                              version based on one by Alexander Terekhov
*/

http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2406.html

-------
For those OS's which do not support a native condition variable, but
do support mutexes and semaphores, one has to use Alexander Terekhov's
"algorithm 8a". This requires two semaphores, a mutex and three
counters.

[...]

A secondary motivation is to explain the lack of reader-writer
priority policies in shared_mutex. This is due to an algorithm
credited to Alexander Terekhov which lets the OS decide which thread
is the next to get the lock without caring whether a unique lock or
shared lock is being sought. This results in a complete lack of reader
or writer starvation. It is simply fair.
-------

regards,
alexander.

--
"PJ points out that lawyers seem to have difficulty understanding the
GPL. My main concern with GPLv3 is that - unlike v2 - non-lawyers can't
understand it either."
                               -- Anonymous Groklaw Visitor