Re: Note describing poor dcache utilization under high memory pressure

From: William Lee Irwin III (wli@holomorphy.com)
Date: Tue Jan 29 2002 - 16:01:16 EST


On Tue, Jan 29, 2002 at 12:49:24PM -0800, Linus Torvalds wrote:
> I really isn't a co-incidence. The reason so many architectures have page
> table trees is that most architects try to make good decisions, and a tree
> layout is a simple and efficient data structure that maps well to both
> hardware and to usage patterns.

No debate there.

On Tue, Jan 29, 2002 at 12:49:24PM -0800, Linus Torvalds wrote:
> Hashed page tables are incredibly naive, and perform badly for build-up
> and tear-down (and mostly have horrible cache access patterns). At least
> in some version of the UltraSparc, the Linux tree-based software TLB fill
> outperformed the Solaris version, even though the Solaris version was
> handtuned assembly and used hardware acceleration for the hash
> computations. That should tell you something.

Given this, it appears less useful to play with the representations.
There also appears to be some other material on this subject which
you yourself have written. I'll review that for my own enlightenment,
and regardless, I'll focus on something else.

Thanks again,
Bill
-
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 : Thu Jan 31 2002 - 21:01:06 EST