lkml.org 
[lkml]   [2007]   [Jul]   [11]   [last100]   RSS Feed
Views: [more markup]  [less markup]  [headers]  [forward] 
 
Messages in this thread
/
DateWed, 11 Jul 2007 06:51:12 +0200
FromNick Piggin <>
SubjectRe: queued spinlock code and results
On Tue, Jul 10, 2007 at 07:26:10PM -0700, Christoph Lameter wrote:
> On Wed, 11 Jul 2007, Nick Piggin wrote:
> 
> > BTW. some advanced congestion algorithms like HBO may find these ticket
> > locks useful because you can see immediately how many CPUs are contending
> > the lock, and spinners know how many CPUs are in front of them. That info
> > could be fed into the spin backoff scheme.
> 
> That would mean having to keep a lot of status information for a spinlock. 
> Gets pretty complicated.

Did you look at the implementation? It takes 2 bytes on x86 and is almost
the same code size and speed as the existing locks.


> The RT tree already converts spinlocks to sleeping locks? If we want to be 
> that complicated then maybe going with one sophisticated lock type for all 
> would be the solution.

I don't want to convert spinlocks to sleeping locks though.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2007-07-11 06:53    [from the cache]
©2003-2008