From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1755304Ab0DARPv (ORCPT ); Thu, 1 Apr 2010 13:15:51 -0400 Received: from mx1.redhat.com ([209.132.183.28]:13016 "EHLO mx1.redhat.com" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1753331Ab0DARPo (ORCPT ); Thu, 1 Apr 2010 13:15:44 -0400 Message-ID: <4BB4D4A1.7040905@redhat.com> Date: Thu, 01 Apr 2010 20:15:13 +0300 From: Avi Kivity User-Agent: Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:1.9.1.8) Gecko/20100301 Fedora/3.0.3-1.fc12 Thunderbird/3.0.3 MIME-Version: 1.0 To: Darren Hart CC: "lkml, " , Steven Rostedt , Peter Zijlstra , Gregory Haskins , Sven-Thorsten Dietrich , Peter Morreale , Chris Wright , Thomas Gleixner , Ingo Molnar , Eric Dumazet , Chris Mason Subject: Re: RFC: Ideal Adaptive Spinning Conditions References: <4BB3D90C.3030108@us.ibm.com> <4BB4ABBB.4000909@redhat.com> <4BB4C1C4.2090208@us.ibm.com> <4BB4C566.8060308@redhat.com> <4BB4D36A.5080204@us.ibm.com> In-Reply-To: <4BB4D36A.5080204@us.ibm.com> Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Sender: linux-kernel-owner@vger.kernel.org List-ID: X-Mailing-List: linux-kernel@vger.kernel.org On 04/01/2010 08:10 PM, Darren Hart wrote: > Avi Kivity wrote: >> On 04/01/2010 06:54 PM, Darren Hart wrote: >>>> A lock(); unlock(); loop spends most of its time with the lock held >>>> or contended. Can you something like this: >>>> >>>> >>>> lock(); >>>> for (i = 0; i < 1000; ++i) >>>> asm volatile ("" : : : "memory"); >>>> unlock(); >>>> for (i = 0; i < 10000; ++i) >>>> asm volatile ("" : : : "memory"); >>> >>> >>> >>> Great idea. I'll be doing a more rigorous investigation on this of >>> course, but I thought I'd share the results of just dumping this >>> into the testcase: >>> >>> # ./futex_lock -i10000000 >>> futex_lock: Measure FUTEX_LOCK operations per second >>> Arguments: iterations=10000000 threads=256 adaptive=0 >>> Result: 420 Kiter/s >>> lock calls: 9999872 >>> lock syscalls: 665824 (6.66%) >>> unlock calls: 9999872 >>> unlock syscalls: 861240 (8.61%) >>> >>> # ./futex_lock -a -i10000000 >>> futex_lock: Measure FUTEX_LOCK operations per second >>> Arguments: iterations=10000000 threads=256 adaptive=1 >>> Result: 426 Kiter/s >>> lock calls: 9999872 >>> lock syscalls: 558787 (5.59%) >>> unlock calls: 9999872 >>> unlock syscalls: 603412 (6.03%) >>> >>> This is the first time I've seen adaptive locking have an advantage! >>> The second set of runs showed a slightly greater advantage. Note >>> that this was still with spinners being limited to one. >> >> Question - do all threads finish at the same time, or wildly >> different times? > > I'm not sure, I can add some fairness metrics to the test that will > help characterize how that's working. My suspicion is that there will > be several threads that don't make any progress until the very end - > since adaptive spinning is an "unfair" locking technique. > Well, if the amount of unfairness differs between the tests (unfair unfairness?) then you may see results that are not directly related to spin vs yield. You need to make the test more self-regulating so the results are more repeatable (yet not make it a round-robin test). -- Do not meddle in the internals of kernels, for they are subtle and quick to panic.