From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1752119AbXA2S4Z (ORCPT ); Mon, 29 Jan 2007 13:56:25 -0500 Received: (majordomo@vger.kernel.org) by vger.kernel.org id S1752552AbXA2S4Y (ORCPT ); Mon, 29 Jan 2007 13:56:24 -0500 Received: from amsfep17-int.chello.nl ([213.46.243.15]:22160 "EHLO amsfep13-int.chello.nl" rhost-flags-OK-FAIL-OK-FAIL) by vger.kernel.org with ESMTP id S1752119AbXA2S4Y (ORCPT ); Mon, 29 Jan 2007 13:56:24 -0500 Subject: Re: [PATCH 00/14] Concurrent Page Cache From: Peter Zijlstra To: Christoph Lameter Cc: linux-kernel@vger.kernel.org, linux-mm@kvack.org, Andrew Morton , Nick Piggin , Ingo Molnar , Rik van Riel In-Reply-To: References: <20070128131343.628722000@programming.kicks-ass.net> <1170093944.6189.192.camel@twins> Content-Type: text/plain Date: Mon, 29 Jan 2007 19:56:17 +0100 Message-Id: <1170096978.10987.39.camel@lappy> Mime-Version: 1.0 X-Mailer: Evolution 2.8.1 Content-Transfer-Encoding: 7bit Sender: linux-kernel-owner@vger.kernel.org X-Mailing-List: linux-kernel@vger.kernel.org On Mon, 2007-01-29 at 10:15 -0800, Christoph Lameter wrote: > On Mon, 29 Jan 2007, Peter Zijlstra wrote: > > > Ladder locking would end up: > > > > lock A0 > > lock B1 > > unlock A0 -> a new operation can start > > lock C2 > > unlock B1 > > lock D5 > > unlock C2 > > ** we do stuff to D5 > > unlock D5 > > > > Instead of taking one lock we would need to take 4? Yep. > Wont doing so cause significant locking overhead? > We probably would want to run some benchmarks. Right, I was hoping the extra locking overhead would be more than compensated by the reduction in lock contention time. But testing is indeed in order. > Maybe disable the scheme for systems with a small number of > processors? CONFIG_RADIX_TREE_CONCURRENT does exactly this.