Affiliation:
1. University of Illinois at Urbana-Champaign
Abstract
This paper
1
describes our experience using the stack processing algorithm [6] for estimating the number of cache misses in scientific programs. By using a new data structure and various optimization techniques we obtain instrumented run-times within 50 to 100 times the original optimized run-times of our benchmarks.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference10 articles.
1. LRU Stack Processing
2. The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers
3. Evaluating associativity in CPU caches
4. Donald E. Knuth. The Art of Computer Programming volume 3 (Sorting and Searching). Addison Wesley Longman 2nd edition 1998. Donald E. Knuth. The Art of Computer Programming volume 3 (Sorting and Searching). Addison Wesley Longman 2nd edition 1998.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Predicting Reuse Interval for Optimized Web Caching: An LSTM-Based Machine Learning Approach;SC22: International Conference for High Performance Computing, Networking, Storage and Analysis;2022-11
2. JEDI;Proceedings of the 22nd ACM Internet Measurement Conference;2022-10-25
3. Learning-based dynamic cache management in a cloud;Journal of Parallel and Distributed Computing;2020-11
4. PG2S+: Stack Distance Construction Using Popularity, Gap and Machine Learning;Proceedings of The Web Conference 2020;2020-04-19
5. Predictable Thread Coarsening;ACM Transactions on Architecture and Code Optimization;2018-06-30