[lkml]   [2003]   [Feb]   [25]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: Minutes from Feb 21 LSE Call
    >> > the only solution is to do rmap lazily, i.e. to start building the rmap
    >> > during swapping by walking the pagetables, basically exactly like I
    >> > refill the lru with anonymous pages only after I start to need this
    >> > information recently in my 2.4 tree, so if you never need to pageout
    >> > heavily several giga of ram (like most of very high end numa servers),
    >> > you'll never waste a single cycle in locking or whatever other
    >> > worthless accounting overhead that hurts performance of all common
    >> > workloads
    >> Did you see the partially object-based rmap stuff? I think that does
    >> very close to what you want already.
    > I don't see how it can optimize away the overhead but I didn't look at
    > it for long.

    Because you don't set up and tear down the rmap pte-chains for every
    fault in / delete of any page ... it just works off the vmas.


    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:33    [W:0.022 / U:27.108 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site