Messages in this thread | | | Date | Fri, 24 Jan 2003 14:21:00 +0530 (IST) | Subject | Re: your mail | From | "Anoop J." <> |
| |
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
> 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: > >> Date: Fri, 24 Jan 2003 11:24:24 +0530 (IST) >> From: Anoop J. <cs99001@nitc.ac.in> >> 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 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/
| |