Please use this identifier to cite or link to this item:
|Title:||Static identification of delinquent loads|
|Citation:||Panait, V.-M., Sasturkar, A., Wong, W.-F. (2004). Static identification of delinquent loads. International Symposium on Code Generation and Optimization, CGO : 303-314. ScholarBank@NUS Repository. https://doi.org/10.1109/CGO.2004.1281683|
|Abstract:||The effective use of processor caches is crucial to the performance of applications. It has been shown that cache misses are not evenly distributed throughout a program. In applications running on RISC-style processors, a small number of delinquent load instructions are responsible for most of the cache misses. Identification of delinquent loads is the key to the success of many cache optimization and prefetching techniques. In this paper, we propose a method for identifying delinquent loads that can be implemented at compile time. Our experiments over eighteen benchmarks from the SPEC suite shows that our proposed scheme is stable across benchmarks, inputs, and cache structures, identifying an average of 10% of the total number of loads in the benchmarks we tested that account for over 90% of all data cache misses. As far as we know, this is the first time a technique for static delinquent load identification with such a level of precision and coverage has been reported. While comparable techniques can also identify load instructions that cover 90% of all data cache misses, they do so by selecting over 50% of all load instructions in the code, resulting in a high number of false positives. If basic block profiling is used in conjunction with our heuristic, then our results show that it is possible to pin down just 1.3% of the load instructions that account for 82% of all data cache misses.|
|Source Title:||International Symposium on Code Generation and Optimization, CGO|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 12, 2019
WEB OF SCIENCETM
checked on Jan 2, 2019
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.