On Tue, Jan 22, 2013 at 3:13 PM, Michel Lespinasse <[email protected]> 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.
<<attachment: graph.png>>
<<attachment: graph.png>>
<<attachment: graph.png>>
