by John McCabe <john@[EMAIL PROTECTED]
>
May 11, 2008 at 09:09 PM
"Dmitry A. Kazakov" <mailbox@[EMAIL PROTECTED]
> wrote:
>This version provides implementations of various locking primitives:
>
> - Plain events which can be signaled, reset and awaited for;
> - Arrays of events which can be signaled, reset and awaited in any
>combination of in race condition free way;
> - Arrays of reentrant mutexes, deadlock-free with an enforced order of
>locking;
> - Race condition free event distributing pulsed value to multiple
tasks;
> - Reentrant mutexes;
> - Race condition free pulse events.
Dmitry
Are any of these (and your earlier releases on shared objects etc)
based on the discussions in the Burns & Wellings book?
Thanks
John
