Re: [Patch 0/17] PTI: Explation of Clean Page Table Interface

[Nick Piggin <nickpiggin@yahoo.com.au>]

Paul Cameron Davies wrote:
> On Wed, 31 May 2006, Nick Piggin wrote:

>> And unless it is something pretty significant, I'd almost bet that Linus,
>> if nobody else, will veto it. Our radix-tree v->p data structure is
>> fairly clean, performant, etc. It matches the logical->physical radix
>> tree data structure we use for pagecache as well.
> 
> 
> Being able to change the page table on a 64 bit machine will
> be a huge advantage into the future when applications really start to
> make use of the 64 bit address space.  The current trie (multi level
> page table - MLPT) is not going to perform against more
> sophisticated data structures in a sparsely occupied 64 bit address space

OK, this is what I mean by better performing. It does not have to
have *zero* performance regressions across the board, but simply
something that tips the cost/benefit.

That does imply that the framework itself would never get included,
without something behind it that does perform better. Which I assume
is your plan.


The release early approach is a good one, so continue to post code
and/or results on linux-mm. I do happen to think you'll have a pretty
hard time getting this in at all, but good luck to you ;)

-- 
SUSE Labs, Novell Inc.
Send instant messages to your online friends http://au.messenger.yahoo.com 

--
To unsubscribe, send a message with 'unsubscribe linux-mm' in
the body to majordomo@kvack.org.  For more info on Linux MM,
see: http://www.linux-mm.org/ .
Don't email: <a href=mailto:"dont@kvack.org"> email@kvack.org </a>