[lkml]   [2002]   [Mar]   [17]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: [Lse-tech] Re: 10.31 second kernel compile
       From: Paul Mackerras <>
    Date: Sat, 16 Mar 2002 22:55:40 +1100 (EST)

    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.

    You only need a 4-level tree for a full 64-bit address space as long
    as you can guarentee less than (32 + PAGE_SHIFT) bits of physical
    addressing (ie. you can use 32-bit pmd_t's and pgd_t's in that case).

    At least this is how I remember the numbers working out.
    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:25    [W:0.021 / U:41.868 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site