Lock convoys



Back in the topic "Lock Free -- where to start" (October 2005),
I gave a quantitative example of how using a lock in a
multithreaded application can increase the number of
context switches the system suffers eleven-fold.

My analysis was of the form:
"Every time a thread is caught holding the lock at the expiry of
its scheduling quantum, the following bad things happen ..."

At the time, I couldn't extend the example to an application
in which thread switching is mainly I/O driven. Besides, eleven-
fold is enough to affect performance, but not to destroy it.

Recently I stumbled across this excellent article which
presents a more powerul mechanism:
http://blogs.msdn.com/sloh/archive/2005/05/27/422605.aspx

The gist of it is that certain synchronisation objects impose
fairness, for example only allowing contending threads to take
a lock strictly in the order in which they blocked on it. Then
the argument becomes:
"If a thread is ever caught holding the lock at the expiry of
its scheduling quantum, even once, the following bad things
happen evermore ..."

AFAICS, if two threads are involved, normal service is likely
to be resumed at the end of the next quantum. If more threads
are involved, the lock convoy persists indefinitely. The cost
of the convoy is one thread switch per lock access, which
could easily mean thousands of switches per quantum
(before taking into account the cost of the switches
themselves).

The example in the article is for Windows CE critical section,
and the article hints that the way critsec works is subject to
change. Does anyone know which other OS'es are likely to
show this behaviour?

Regards,
Chris

.



Relevant Pages

  • Re: Tech: Whirlwind target bug-like oddity
    ... the game only spots a compass target if you do ... must be completed to light Lock... ... shows what I'd expect - 3 trough switches and ramp down. ...
    (rec.games.pinball)
  • Re: Lock Free -- where to start
    ... I know IOCP sometimes schedules more). ... connection between IOCP and lock efficiency is. ... >>> switches before the original thread gets the processor ... you need the assumption that the system can get *no* useful work ...
    (comp.programming.threads)
  • Re: Lock convoys
    ... context switches the system suffers eleven-fold. ... "Every time a thread is caught holding the lock at the expiry of ... its scheduling quantum, the following bad things happen ..." ... thread/process that accepts messages from clients. ...
    (comp.programming.threads)
  • Re: Lock convoys
    ... context switches the system suffers eleven-fold. ... "Every time a thread is caught holding the lock at the expiry of ... its scheduling quantum, the following bad things happen ..." ... suspend/resume overhead as long as the contention is not constant. ...
    (comp.programming.threads)
  • Re: Lock convoys
    ... context switches the system suffers eleven-fold. ... "Every time a thread is caught holding the lock at the expiry of ... its scheduling quantum, the following bad things happen ..." ...
    (comp.programming.threads)