On Mon, 30 Jul 2001, Bruce Momjian wrote:
> > Bruce Momjian <pgman@candle.pha.pa.us> writes:
> > > Actually, with this new code, we could go back to locking in oid order,
> > > which would eliminate the problem.
> >
> > No it wouldn't. If anything, locking in a *randomized* order would be
> > the best bet. But I have no confidence in this approach, anyway.
>
> I am looking for a way to get this in there without munging the lock
> code, which is already quite complex. What about doing some sort of
> small sleep after we reset back to the beginning of the table list.
It seems to me that we already have a small sleep in place. After all, in
order to acquite a lock, the shared memory area has to be accessed. So,
the contenders for a lock both have to go through a spin lock. So, if we
have the two "stuck" processes as in Tom's example, one will win at
acquiring the spin lock and the other will have to wait. So, they become
desynchronized, regardless of how many CPUs or what memory architecture
you have.
Neil
--
Neil Padgett
Red Hat Canada Ltd. E-Mail: npadgett@redhat.com
2323 Yonge Street, Suite #300,
Toronto, ON M4P 2C9