On Sat, 5 Apr 2003, Andrea Arcangeli wrote:
> that's wasted memory IMHO, if you need nonlinear, you don't want to
> waste further metadata, you only want to pin pages in the pagetables,
> the 'window' over the pagecache (incidentally shm)
Agreed.
> > > - pte_chain setup and teardown CPU cost.
> > >
> > > objrmap does not seem to help. Page clustering might, but is unlikely to
> > > be enabled on the machines which actually care about the overhead.
> >
> > eh? Not sure what you mean by that. It helped massively ...
> > diffprofile from kernbench showed:
>
> Indeed. objrmap is the only way to avoid the big rmap waste. Infact I'm
> not even convinced about the hybrid approch, rmap should be avoided even
> for the anon pages. And the swap cpu doesn't matter, as far as we can
> reach pagteables in linear time that's fine, doesn't matter how many
> fixed cycles it takes. Only the complexity factor matters, and objrmap
> takes care of it just fine.
The only issues with objrmap seems to be mremap, which Hugh
seems to have taken care of, and the case of a large number
of processes mapping different parts of the same file multiple
times (1000 processes mapping each 1000 parts of the same file),
which would grow the complexity of the VMA search from linear
to quadratical.
That last case is also fixable, though, probably best done using
k-d trees.
Except for nonlinear VMAs I don't think there are any big obstacles
left that would keep us from switching to object rmap.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
This archive was generated by hypermail 2b29 : Mon Apr 07 2003 - 22:00:25 EST