Subj : Re: Deadlock theorem
To   : comp.programming.threads
From : Uenal Mutlu
Date : Tue May 03 2005 08:30 pm

"Junker" wrote
> "Uenal Mutlu" wrote
>
> > Theorem:
> >    a) "There will be no deadlock if the objects are locked in the same order."
> >    b) "Unlocking can be done in any order."
> >
> I've worked on multithreaded projects that use this technique before.
> We always described it as ordered locking, although that probably
> isn't the only name for the technique.
>
> When I was new to writing multithreading code and did some research on
> the Internet, I found many descriptions of ordered locking systems to
> avoid deadlock.
>
> What you have described does not sound any different to me, unless
> there is something I am missing? Try googling for "ordered locking"
> and deadlock and you should find plenty of information on this
> technique.

Thanks, indeed it seems to be the same technique.

.