Messages in this thread | | | Date | Tue, 29 Jan 2002 21:35:38 -0200 (BRST) | From | Rik van Riel <> | Subject | Re: [PATCH] Radix-tree pagecache for 2.5 |
| |
On Tue, 29 Jan 2002, Alan Cox wrote:
> > We can let oracle shared memory segments use 4 MB pages, > > but still use the normal page cache code to look up the > > pages. > > That has some potential big wins beyond oracle. Some of the big number > crunching algorithms also benefit heavily from 4Mb pages even when you > try and minimise tlb misses.
Note that I'm not sure whether the complexity of using 4 MB pages is worth it or not ... I just like the fact that the radix tree page cache gives us the opportunity to easily implement and try it.
I like radix trees for making our design more flexible and opening doors to possible new functionality.
It could even be a CONFIG option for the embedded folks, if we can keep the code isolated enough ;)
cheers,
Rik -- "Linux holds advantages over the single-vendor commercial OS" -- Microsoft's "Competing with Linux" document
http://www.surriel.com/ http://distro.conectiva.com/
- 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/
| |