The Community for Technology Leaders
2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT) (2010)
Vienna, Austria
Sept. 11, 2010 to Sept. 15, 2010
ISBN: 978-1-5090-5032-1
pp: 549-550
Mohammad Hammoud , Department of Computer Science, University of Pittsburgh, PA, USA
Sangyeun Cho , Department of Computer Science, University of Pittsburgh, PA, USA
Rami G. Melhem , Department of Computer Science, University of Pittsburgh, PA, USA
ABSTRACT
This poster describes an intra-tile cache set balancing strategy that exploits the demand imbalance across sets within the same L2 cache bank. This strategy retains some fraction of the working set at underutilized sets so as to satisfy far-flung reuses. It adapts to phase changes in programs and promotes a very flexible sharing among cache sets referred to as many-from-many sharing. Simulation results using a full system simulator demonstrate the effectiveness of the proposed scheme and show that it compares favorably with related cache designs on a 16-way tiled CMP platform.
INDEX TERMS
Many-From-Many Sharing, Set Balancing
CITATION
Mohammad Hammoud, Sangyeun Cho, Rami G. Melhem, "An intra-tile cache set balancing scheme", 2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT), vol. 00, no. , pp. 549-550, 2010, doi:
159 ms
(Ver 3.3 (11022016))