NUcache: a multicore cache organization based on next-use distance

ABSTRACT

In this work, we propose a new organization for the last level shared cache of a multicore system. Our design is based on the observation that the Next-Use distance, measured in terms of intervening misses between the eviction of a line and its next use, for lines brought in by a given delinquent PC falls within a predictable range of values. We exploit this correlation to improve the performance of shared caches in multi-core architectures by proposing the NUcache organization.

References

1. }}Belady, L. A. A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal 5, 2 (1966), 78.
2. }}Luo, K., Gummaraju, J., and Franklin, M. Balancing thoughput and fairness in smt processors. In Performance Analysis of Systems and Software, 2001. ISPASS. 2001 IEEE International Symposium on (2001), pp. 164--171.
3. }}Qureshi, M. K., and Patt, Y. N. Utility-based cache partitioning: A low-overhead, high-performance, runtime mechanism to partition shared caches. In MICRO 39: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006), pp. 423--432.
4. }}Xie, Y., and Loh, G. H. Pipp: promotion/insertion pseudo-partitioning of multi-core shared caches. In ISCA '09: Proceedings of the 36th annual international symposium on Computer architecture (2009), pp. 174--183.

Index Terms

• Computer systems organization

  • Architectures