[lkml]   [2002]   [Mar]   [16]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [Lse-tech] Re: 10.31 second kernel compile
Linus Torvalds writes:

> But more importantly than that, the whole point really is that the page
> table tree as far as Linux is concerned is nothing but an _abstraction_
> of the VM mapping hardware. It so happens that a tree format is the only
> sane format to keep full VM information that works well with real loads.

Is that still true when we get to wanting to support a full 64-bit
address space? Given that we can already tolerate losing PTEs for
resident pages from the page tables quite happily (since they can be
reconstructed from the information in the vm_area_structs and the page
cache), I don't see that the fact that a hash table will sometimes
lose PTEs because of a hash bucket filling up is all that much of a
problem. (We would need to find some other way of dealing with swap
entries of course.)

IMHO it would be interesting to compare the size and complexity of
using a hash table for the page tables with a 5-level tree. For a
32-bit address space I think the tree wins hands down but for a full
64-bit address space I am not convinced either way at present.

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2005-03-22 13:24    [W:0.105 / U:1.072 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site