The working set model for program behavior
Communications of the ACM
Determining WWW User's Next Access and Its Application to Pre-fetching
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Entropy representation of memory access characteristics and cache performance
ACST '08 Proceedings of the Fourth IASTED International Conference on Advances in Computer Science and Technology
A strip-down database for modern information systems
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
WINE'05 Proceedings of the First international conference on Internet and Network Economics
PCantorSim: Accelerating parallel architecture simulation through fractal-based sampling
ACM Transactions on Architecture and Code Optimization (TACO)
| Hi-index | 0.00 |
This paper uses fractals to model the clustering of cache misses. The clustering of cache misses can be quantified by a single number analog to a fractional dimension, and we are intrigued by the possibility that this number can be used as a measure of software complexity. The essential intuition is that cache misses are a direct reflection of changes in locality of reference, and that complex software requires more frequent (and larger) changes in this locality than simple software. The cluster dimension provides a measure (and perhaps the basis for a model) of the intrinsic differences between workloads. In this paper, we focus on cache miss activity as a discriminate between interactive and batch environments.