A Probabilistic Cache Sharing Mechanism for Chip Multiprocessors
Parsec
False sharing
Shared resource
DOI:
10.4028/www.scientific.net/amm.135-136.119
Publication Date:
2011-10-27T12:06:22Z
AUTHORS (4)
ABSTRACT
Capacity sharing is efficient for private L2 caches to utilize cache resources in chip multiprocessors. We propose a probabilistic mechanism using reuse replacement strategy. This adopts decoupled tag and data arrays, partitions the arrays into shared regions. Probability introduced control capability of each core compete resources. assign high probabilities cores with stress memory demands dynamically adjust these corresponding monitored run-time demands. Simulation results PARSEC benchmarks show that our exceeds conventional LRU managed cache. Compared without among cores, achieves an average miss rate reduction 8.70%.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (11)
CITATIONS (0)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....