From mboxrd@z Thu Jan 1 00:00:00 1970 From: Peter Zijlstra Subject: Re: [RFC][PATCH 1/6] mm: slab allocation fairness Date: Thu, 30 Nov 2006 20:40:12 +0100 Message-ID: <1164915612.6588.171.camel@twins> References: <20061130101451.495412000@chello.nl> > <20061130101921.113055000@chello.nl> > <1164913365.6588.156.camel@twins> Mime-Version: 1.0 Content-Type: text/plain Content-Transfer-Encoding: 7bit Cc: netdev@vger.kernel.org, linux-mm@kvack.org, David Miller Return-path: Received: from amsfep17-int.chello.nl ([213.46.243.15]:55344 "EHLO amsfep14-int.chello.nl") by vger.kernel.org with ESMTP id S1031269AbWK3T5q (ORCPT ); Thu, 30 Nov 2006 14:57:46 -0500 To: Christoph Lameter In-Reply-To: Sender: netdev-owner@vger.kernel.org List-Id: netdev.vger.kernel.org On Thu, 2006-11-30 at 11:37 -0800, Christoph Lameter wrote: > On Thu, 30 Nov 2006, Peter Zijlstra wrote: > > > On Thu, 2006-11-30 at 10:52 -0800, Christoph Lameter wrote: > > > > > I would think that one would need a rank with each cached object and > > > free slab in order to do this the right way. > > > > Allocation hardness is a temporal attribute, ie. it changes over time. > > Hence I do it per slab. > > cached objects are also temporal and change over time. Sure, but there is nothing wrong with using a slab page with a lower allocation rank when there is memory aplenty. I'm just not seeing how keeping all individual page ranks would make this better. The only thing that matters is the actual free pages limit, not that of a few allocation ago. The stored rank is a safe shortcut for it allows harder allocation to use easily obtainable free space not the other way around.