| Date | Sun, 6 Apr 2003 05:29:43 -0400 | From | Benjamin LaHaise <> | Subject | Re: objrmap and vmtruncate |
| |
On Sat, Apr 05, 2003 at 06:30:03PM +0200, Andrea Arcangeli wrote: > > I'm not questioning during paging rmap is more efficient than objrmap, > but your argument about rmap having lower complexity of objrmap and that > rmap is needed is wrong. The fact is that with your 100 mappings per > each of the 100 tasks case, both algorithms works in O(N) where N is > the number of the pagetables mapping the page. No difference in
Small mistake on your part: there are two different parameters to that: objrmap is O(N) where N is the number of vmas, and regular rmap is O(M) where M is the number of currently mapped ptes. M <= N and is frequently less for sparsely resident pages (ie in things like executables).
-ben - 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/
|