Messages in this thread | | | Date | Fri, 24 Jan 2003 11:24:24 +0530 (IST) | Subject | | From | "Anoop J." <> |
| |
How is this different from a fully associative cache .Would be better if u could deal it based on the address bits used
Thanks
David Lang wrote:
>The idea of page coloring is based on the fact that common implementations >of caching can't put any page in memory in any line in the cache (such an >implementation is possible, but is more expensive to do so is not commonly >done) > >With this implementation it means that if your program happens to use >memory that cannot be mapped to half of the cache lines then effectivly >the CPU cache is half it's rated size for your program. the next time your >program runs it may get a more favorable memory allocation and be able to >use all of the cache and therefor run faster. > >Page coloring is an attampt to take this into account when allocating >memory to programs so that every program gets to use all of the cache. > >David Lang > > > On Fri, 24 Jan 2003, Anoop J. wrote: > >>Date: Fri, 24 Jan 2003 10:38:03 +0530 (IST) >>From: Anoop J. <cs99001@nitc.ac.in> >>To: linux-kernel@vger.kernel.org, linux-mm@kvack.org >> >> >>How does page coloring work. Iwant its mechanism not the implementation. >>I went through some pages of W.L.Lynch's paper on cache and VM. Still not >>able to grasp it . >> >> >>Thanks in advance >> >> >> >>- >>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/ >> >
- 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/
| |