Fast modeling of shared caches in multicore systems

HiPEAC'11 - Proceedings of the 6th International Conference on High Performance and Embedded Architectures and Compilers

Volumn , Issue , 2011, Pages 147-157

  Eklov, David ^a   Black Schaffer, David ^a   Hagersten, Erik ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK SUITES; CACHE MISS; FAST ALGORITHMS; MULTI-CORE SYSTEMS; PERFORMANCE MODEL; REUSE DISTANCE; SHARED CACHE; SYSTEM OF EQUATIONS;

PROGRAM COMPILERS;

ESTIMATION;

EID: 79952932476     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1944862.1944885     Document Type: Conference Paper

References (22)

1. A. Fedorova, M. Seltzer and M. D. Smith. A Non-Work-Conserving Operating System Scheduler for SMT Processors. In Proceedings of the Workshop on the Interaction between Operating Systems and Computer Architecture (WIOSCA), in conjunction with ISCA-33, Boston, MA, USA, June 2006.
2. A. Fedorova, M. Seltzer and M. D. Smith. Cache-fair Thread Scheduling for Multicore Processors. Technical Report TR-17-06, Division of Engineering and Applied Sciences, Harvard University, Oct. 2006.
3. A. Fedorova, M. Seltzer, C. Small and D. Nussbaum. Performance of Multithreaded Chip Multiprocessors and Implications for Operating System Design. In ATEC'05: Proceedings of the annual conference on USENIX Annual Technical Conference, pages 26-26, Berkeley, CA, USA, 2005. USENIX Association.
4. E. Berg and E. Hagersten. StatCache: A Probabilistic Approach to Efficient and Accurate Data Locality Analysis. In Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS-2004), Austin, Texas, USA, Mar. 2004.
5. E. Berg and E. Hagersten. Fast Data-Locality Profiling of Native Execution. In Proceedings of ACM SIGMETRICS 2005, Banff, Canada, June 2005.
6. D. Chandra, F. Guo, S. Kim, and Y. Solihin. Predicting Inter-Thread Cache Contention on a Chip Multi-Processor Architecture. In HPCA'05: Proceedings of the 11th International Symposium on High-Performance Computer Architecture, pages 340-351, Washington, DC, USA, 2005. IEEE Computer Society. (Pubitemid 41731513)
7. X. E. Chen and T. M. Aamodt. A First-Order Fine-Grained Multithreaded Throughput Model. In IEEE International Symposium on High Performance Computer Architecture (HPCA 2009), pages 329-340, Raleigh, North Carolina, USA, Feb. 2009.
8. C. Ding and Y. Zhong. Predicting Whole-Program Locality Through Reuse Distance Analysis. In PLDI'03: Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation, pages 245-257, New York, NY, USA, 2003. ACM.
9. D. Eklov, D. Black-Schaffer, and E. Hagersten. StatCC: A Statistical Cache Contention Model. In PACT'10: Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques, pages 551-552, Vienna, Austria, Sept. 2010.
10. D. Eklov and E. Hagersten. StatStack: Efficient Modeling of LRU caches. In Proceedings of the 2010 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS-2010), White Plains, NY, USA, Mar. 2010.
11. S. Eyerman, L. Eeckhout, T. Karkhanis, and J. E. Smith. A Mechanistic Performance Model for Superscalar out-of-order Processors. ACM Trans. Comput. Syst., 27(2):1-37, 2009.
12. T. S. Karkhanis and J. E. Smith. A First-Order Superscalar Processor Model. SIGARCHComput. Archit. News, 32(2):338, 2004.
13. R. E. Kessler, M. D. Hill, and D. A. Wood. A comparison of trace-sampling techniques for multi-megabyte caches. IEEE Trans. Comput., 43(6):664-675, 1994.
14. P. S. Magnusson, M. Christensson, J. Eskilson, D. Forsgren, G. Hàllberg, J. Högberg, F. Larsson, A. Moestedt, and B. Werner. Simics: A Full System Simulation Platform. Computer, 35:50-58, 2002.
15. R. L. Mattson, J. Gecsei, D. R. Slutz, and I. L. Traiger. Evaluation Techniques for Storage Hierarchies. IBM Systems Journal, 9(2):78-117, 1970.
16. F. Olken. Efficient Methods for Calculating the Success Function of Fixed Space Replacement Policies. Technical Report LBL-12370, Lawrence Berkeley Lab Berkeley, May 1981.
17. D. L. Schuff, M. Kulkarni, and V. S. Pai. Accelerating Multicore Reuse Distance Analysis with Sampling and Parallelization. In PACT'10: Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques, Vienna, Austria, Sept. 2010.
18. X. Shen, J. Shaw, B. Meeker, and C. Ding. Locality approximation using time. In POPL'07: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 55-61, New York, NY, USA, 2007. ACM.
19. R. A. Sugumar and S. G. Abraham. Efficient simulation of caches under optimal replacement with applications to miss characterization. SIGMETRICSPerform. Eval. Rev., 21(1):24-35, 1993.
20. T. M. Taha and S. Wills. An Instruction Throughput Model of Superscalar Processors. IEEE Trans. Comput., 57(3):389-403, 2008. (Pubitemid 351627052)
21. R. E. Wunderlich, T. F. Wenisch, B. Falsafi, and J. C. Hoe. SMARTS: Accelerating microarchitecture simulation via rigorous statistical sampling. In Proceedings of the International Symposium on Computer Architecture, pages 84-95, 2003.
22. Y. Zhong and W. Chang. Sampling-based program locality approximation. In ISMM'08: Proceedings of the 7th international symposium on Memory management, pages 91-100, New York, NY, USA, 2008. ACM.