Shmuel Gal, Willard Miranker
Journal of Combinatorial Theory, Series A
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.
Shmuel Gal, Willard Miranker
Journal of Combinatorial Theory, Series A
Nadav Eiron, Michael Rodeh, et al.
ACM Journal of Experimental Algorithmics
Alon Itai, Michael Rodeh
Acta Informatica
Alon Itai, Michael Rodeh
Journal of Algorithms