Frequent Value Locality and Value-Centric Data Cache Design (2000)
Cached
Download Links
- [www.cs.arizona.edu]
- [www.mtl.t.u-tokyo.ac.jp]
- [www.mtl.t.u-tokyo.ac.jp]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems |
| Citations: | 47 - 13 self |
BibTeX
@INPROCEEDINGS{Zhang00frequentvalue,
author = {Youtao Zhang and Jun Yang and Rajiv Gupta},
title = {Frequent Value Locality and Value-Centric Data Cache Design},
booktitle = {In Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems},
year = {2000},
pages = {150--159}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
By studying the behavior of programs in the SPECint95 suite we observed that six out of eight programs exhibit a new kind of value locality, the frequent value locality, according to which a few values appear very frequently in memory locations and are therefore involved in a large fraction of memory accesses. In these six programs ten distinct values occupy over 50% of all memory locations and on an average account for nearly 50% of all memory accesses during program execution. This observation holds for smaller blocks of consecutive memory locations and the set of frequent values remains quite stable over the execution of the program. In the six benchmarks with frequent value locality, on an average 50% of all cache misses occur during the reading or writing of the ten most frequently accessed values. We propose a new data cache structure, the frequent value cache (FVC), which employs a value-centric approach to caching data locations for exploiting the frequent value locality phen...
Citations
No citations identified.
