An Empirical Study of Task Switching Locality in MVS
IEEE Transactions on Computers
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Cold-start vs. warm-start miss ratios
Communications of the ACM
Use of the LRU stack depth distribution for simulation of paging behavior
Communications of the ACM
Properties of the working-set model
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Bibliography and reading on CPU cache memories and related topics
ACM SIGARCH Computer Architecture News
Program Behavior: Models and Measurements
Program Behavior: Models and Measurements
Comparison of the Working Sets and Bounded Locality Intervals of a Program
Proceedings of the International Workshop organized by the Commision of the European Communities on Modelling and Performance Evaluation of Computer Systems
On the Working Set Size for the Markov Chain Model of Program Behaviour
Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
Cache hit ratios with geometric task switch intervals
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
STORAGE HIERARCHY SYSTEMS
Program locality and dynamic memory management.
Program locality and dynamic memory management.
Instruction reference behavior and locality of reference in paging
Instruction reference behavior and locality of reference in paging
Synthetic Traces for Trace-Driven Simulation of Cache Memories
IEEE Transactions on Computers
A Model of Workloads and its Use in Miss-Rate Prediction for Fully Associative Caches
IEEE Transactions on Computers
ACM SIGMETRICS Performance Evaluation Review
Workload models of VBR video traffic and their use in resource allocation policies
IEEE/ACM Transactions on Networking (TON)
Automatic and efficient evaluation of memory hierarchies for embedded systems
Proceedings of the 32nd annual ACM/IEEE international symposium on Microarchitecture
Modeling Live and Dead Lines in Cache Memory Systems
IEEE Transactions on Computers
Performance Tradeoffs in Multithreaded Processors
IEEE Transactions on Parallel and Distributed Systems
Characteristics of Temporal and Spatial Locality of Internet Access Patterns
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
Yet shorter warmup by combining no-state-loss and MRRL for sampled LRU cache simulation
Journal of Systems and Software - Special issue: Quality software
International Journal of Modelling and Simulation
Optimal eviction policies for stochastic address traces
Theoretical Computer Science
| Hi-index | 14.99 |
To model cache behavior in a multiprogramming environment, it is necessary to know the number of distinct lines referenced in an execution interval. The stack growth function (SGF) relates the mean number of references (or instructions) to the number of distinct lines referenced; it can be viewed as the inverse function of the mean working set size. A fast, one-pass algorithm to compute the SGF for a given referenced string is presented. SGFs measured for some 40 real programs show that a simple exponential model fits the SGFs reasonably well over a range of execution intervals. Parameters of the inverse exponential model are presented for several program mixes and cache line sizes of 32 and 64 bytes. Separate instruction and data SGFs also are examined, and execution interval distribution effects are considered.