Subj : Re: Deadlock theorem
To   : comp.programming.threads
From : David Schwartz
Date : Mon May 02 2005 12:24 pm


"Uenal Mutlu" <520001085531-0001@t-online.de> wrote in message 
news:d55bm1$92r$03$1@news.t-online.com...

    Now you say:

> Of course you are right. I'm aware of the deadlock when there
> is more than 1 thread. The purpose of the code was just to
> show one of the differences between the definition of hierarchical
> locking and my method.

    But before you write:

> Theorem:
>    a) "There will be no deadlock if the objects are locked in the same 
> order."
>    b) "Unlocking can be done in any order."

    So now I'm totally baffled. Wasn't the point of your theorem to 
guarantee that there could never be any deadlocks?

    DS

.