lkml.org 
[lkml]   [2013]   [Jan]   [22]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
SubjectRe: [RFC PATCH 0/6] fast queue spinlocks
From
On Tue, Jan 22, 2013 at 3:13 PM, Michel Lespinasse <walken@google.com> wrote:
> Additionally I will attach (as a reply to this email) graphs showing total
> spinlock throughput for a microbenchmark consisting of N threads doing
> lock/unlock operations in a tight loop. We can see that the proposed
> fast queue spinlock is comparable to ticket spinlocks for low number
> of threads, scales much better for high number of threads, and is always
> faster than the MCS strawman proposal (which did have the issue of being
> kinda slow at around 2-3 threads).
> mach1 is a 4 socket AMD Barcelona system (16 cores total)
> mach2 is a 2 socket Intel Westmere system (12 cores / 24 threads total)
> mach3 is a 2 socket Intel Sandybridge system (16 cores / 32 threads total)

Graphs are attached (admittedly not the most interesting benchmark).

--
Michel "Walken" Lespinasse
A program is never fully debugged until the last user dies.
[unhandled content-type:image/png][unhandled content-type:image/png][unhandled content-type:image/png]
\
 
 \ /
  Last update: 2013-01-23 01:02    [W:0.137 / U:0.036 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site