Amihood Amir, Dmitry Keselman, et al.
Journal of Algorithms
Computer cache memory simulations consume a lot of resources, both in terms of disk space and CPU time. A statistical approach to this problem is proposed in which program traces are sampled at certain intervals, significantly reducing the required computer resources. Using, both the mathematical analysis and experimentation, we show that this approach can achieve a high accuracy in predicting the hit and miss ratios for cache simulations. Copyright © 1996 by Marcel Dekker, Inc.
Amihood Amir, Dmitry Keselman, et al.
Journal of Algorithms
David Bernstein, Doron Cohen, et al.
MICRO 1994
Nadav Eiron, Michael Rodeh, et al.
ACM Journal of Experimental Algorithmics
David Bernstein, Michael Rodeh, et al.
Journal of Algorithms