Abstract

Page-coloring and bin-hopping are two well-known page mapping schemes for reducing cache conflicts. Previous work found bin-hopping to have 4% less cache miss rate than page-coloring on uniprocessor machines. Using execution-driven simulations, we find that bin-hopping significantly outperforms simplistic page-coloring on CC-NUMA multiprocessors. In certain cases, bin-hopping has 32–58% less execution time and over 60% fewer cache misses. By using part of the memory ID bits to hash the page color during page-mapping, we improve the performance of page-coloring to match that of bin-hopping on CC-NUMA multiprocessors.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.