[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20100121175914.GA8910@basil.fritz.box>
Date: Thu, 21 Jan 2010 18:59:14 +0100
From: Andi Kleen <andi@...stfloor.org>
To: Don Mullis <don.mullis@...il.com>
Cc: linux-kernel@...r.kernel.org, airlied@...hat.com,
andi@...stfloor.org, david@...morbit.com, dedekind@...radead.org
Subject: Re: [PATCH 1/2] lib: more scalable list_sort()
On Wed, Jan 20, 2010 at 08:51:26PM -0800, Don Mullis wrote:
> The use of list_sort() by UBIFS looks like it could generate long
> lists; this alternative implementation scales better, reaching ~3x
> performance gain as list length approaches the L2 cache size.
If this can really be called with long lists
the function likely needs (optional) need_resched()s
Otherwise it could ruin scheduling latencies.
-Andi
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists