![]() | |||||||||||
Messages in this thread |
Christoph Lameter wrote: > On Mon, 8 May 2006, Martin J. Bligh wrote:> > >>Can't you use sparsemem instead? It solves the same problem without the >>magic faulting, doesn't it?> > > But sparsemem has more complex table lookups. Ultimately IA64 will move > to sparsemem (I think) but we are not there yet and we would like to be > sure that there are no performance regressions with that move. Please explain your concerns in more detail re complexity. I was under the impression the design avoided that nicely by folding the calculations together down into a single layer. It's been around for a long time now ... has nobody tested the performance on ia64 yet? M. - 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/ | ||||||||||
| Last update: 2006-05-09 08:19 [from the cache] ©2003-2008 | |||||||||||