I think this is a case of the same tuerm being used for two different
purposes. I don't know the use you are refering to.

David Lang


On Fri, 24 Jan 2003, Anoop J. wrote:

I read that the data coherency problem due to virtual indexing is avoided
through page coloring and it has also got the speed of physical indexing
can u just elaborate on how this is possible?


Thanks

quoted

implementing a fully associative cache eliminates the need for page
coloring, but it has to be implemented in hardware. if you don't have
fully associative caches in your hardware page coloring helps avoid the
worst case memory allocations.

from what I have seen on the attempts to implement it the problem is
that the calculations needed to do page colored allocations end up
costing enough that they end up with a net loss compared to the old
method.

David Lang


 On Fri, 24 Jan 2003, Anoop J.
wrote:

quoted

Date: Fri, 24 Jan 2003 11:24:24 +0530 (IST)
From: Anoop J. <redacted>
To: linux-mm@kvack.org, linux-kernel@vger.kernel.org


How is this different from a fully associative cache .Would be better
if u could deal it based on the address bits used

--
To unsubscribe, send a message with 'unsubscribe linux-mm' in
the body to majordomo@kvack.org.  For more info on Linux MM,
see: http://www.linux-mm.org/