This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Fractal Dimension of Computer Programs and its Application to the Prediction of the Cache Miss Ratio
July 1989 (vol. 38 no. 7)
pp. 1012-1026
ASCII Text
x 
 
D. Thiebaut, "On the Fractal Dimension of Computer Programs and its Application to the Prediction of the Cache Miss Ratio," IEEE Transactions on Computers, vol. 38, no. 7, pp. 1012-1026, July, 1989.
 
 
BibTex
x
 
@article{ 10.1109/12.30852,
author = {D. Thiebaut},
title = {On the Fractal Dimension of Computer Programs and its Application to the Prediction of the Cache Miss Ratio},
journal ={IEEE Transactions on Computers},
volume = {38},
number = {7},
issn = {0018-9340},
year = {1989},
pages = {1012-1026},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.30852},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - On the Fractal Dimension of Computer Programs and its Application to the Prediction of the Cache Miss Ratio
IS - 7
SN - 0018-9340
SP1012
EP1026
EPD - 1012-1026
A1 - D. Thiebaut,
PY - 1989
KW - cache miss ratio prediction; fractal geometry; fractal dimension; computer programs; one-dimensional fractal random-walks; parameterization; trace-driven simulations; buffer storage; computational complexity; programming theory.
VL - 38
JA - IEEE Transactions on Computers
ER -
 
Fractal geometry is proposed as a powerful measure of program behavior, and its application to the prediction of the miss ratio of programs in fully associative caches is presented. Programs are modeled as one-dimensional fractal random-walks. The fractal cache model is based on the parameterization of a program trace by a small number of constants, one of which is the fractal dimension of the

[1] A. Agarwal, H. Horowitz, and J. Hennessy, "An analytical cache model," Tech. Rep. CSL-TR-86-304, Stanford Univ., Stanford, CA 94305, pp. 1-45, Sept. 1986.
[2] A. Agarwal, H. Horowitz, and J. Hennessy, "Cache performance of operating system and multiprogramming workloads," Comput. Syst. Lab., Stanford Univ., Stanford, CA 94305, to be published.
[3] J. M. Berger and B. Mandelbrot, "A new model for error clustering in telephone circuits,"IBM J. Res. Develop., vol. 7, pp. 224-236, July 1963.
[4] C. K. Chow, "On optimization of storage hierarchy,"IBM J. Res. Develop., vol. 18, pp. 194-203, May 1974.
[5] C. K. Chow, "Determining the optimum capacity of a cache memory,"IBM Tech. Disclos. Bull., vol. 17, pp. 3163-3166, Mar. 1975.
[6] C. K. Chow, "Determination of cache's capacity and its matching storage hierarchy,"IEEE Trans. Comput., vol. C-25, pp. 157-164, Feb. 1976.
[7] D. W. Clark and J. S. Emer, "Performance of the VAX-11/780 translation buffer: Simulation and measurement,"ACM Trans. Comput. Syst., vol. 3, pp. 31-62, Feb. 1985.
[8] M. C. Easton and R. Fagin, "Cold-start versus warm-start miss ratios,"Commun. ACM, vol. 21, no. 10, pp. 866-872, Oct. 1978.
[9] M. C. Easton, "Computations of cold-start miss ratios,"IEEE Trans. Comput., vol. C-27, pp. 404-408, May 1978.
[10] W. Feller,An Introduction to Probability Theory and Its Applications. Vol. I. New York: Wiley, 1968, chs. 3 and 14.
[11] W. Feller,An Introduction to Probability Theory and Its Applications. Vol. II. New York: Wiley, 1971, ch. 6.
[12] P. M. Fenwick, "Some aspect of the dynamic behavior of hierarchical memories,"IEEE Trans. Comput., vol. C-34, pp. 570-573, June 1985.
[13] J. Gecsei and J. A. Lukes, "A model for the evaluation of storage hierarchies,"IBM Syst. J., pp. 163-180, Feb. 1974.
[14] J. Gecsei, "Determining hit ratios for multilevel hierarchies,"IBM J. Res. Develop., pp. 316-327, July 1974.
[15] J. E. Gillis and G. H. Weiss, "Expected number of distinct sites visited by a random walk with an infinite variance,"J. Math. Phys., vol. 11, pp. 1307-1312, Apr. 1970.
[16] B. D. Hughes and S. Prager, "Random processes and random systems: An introduction," inThe Mathematics and Physics of Disordered Media, B. D. Hughes and B. W. Ninham, Eds. New York: Springer-Verlag, 1983.
[17] S. Laha, J. H. Patel, and R. K. Iyer, "Accurate low-cost methods for performance evaluation of cache memory systems," Tech. Rep., Coordinated Sci. Lab., Univ. of Illinois at Urbana-Champaign, Urbana, IL 61801, pp. 1-26, 1986;IEEE Trans. Comput., to be published.
[18] A. Lehmann, "Performance evaluation and prediction of storage hierarchies,"ACM Sigmet., Perform. Eval. 1980, vol. 9, pp. 43-54, May 1980.
[19] B. Mandelbrot, "Self similar error clusters in communication systems and the concept of conditional stationarity,"IEEE Trans. Commun. Technol., vol. 13, pp. 71-90, Mar. 1965.
[20] B. Mandelbrot,The Fractal Geometry of Nature. San Francisco, CA: Freeman, 1983.
[21] E. W. Montroll and G. H. Weiss, "Random walks on lattices. II,"J. Math. Phys., vol. 6, pp. 167-181, Feb. 1965.
[22] T. Puzak, "An analysis of cache replacement algorithms," Ph.D. dissertation., Univ. of Massachusetts, Feb. 1985.
[23] G. S. Rao, "Performance analysis of cache memories,"J. ACM, vol. 25, no. 3, pp. 378-385, July 1978.
[24] M. Satyanarayanan and D. Bhandarkar, "Design trade-offs in VAX-11 translation buffer organization,"IEEE Computer, vol. 14, pp. 103- 111, Dec. 1981.
[25] A. J. Smith, "A comparative study of set associative memory mapping algorithms and their use for cache and main memory,"IEEE Trans. Software Eng., vol. SE-4, pp. 121-130, Mar. 78.
[26] A. Smith, "Cache Memories,"Computing Surveys, Vol. 14, No. 3, Sept. 1982, pp. 473- 530.
[27] A. J. Smith, "Disk cache-miss ratio analysis and design considerations,"ACM Trans. Comput. Syst., vol. 3, no. 3, pp. 161-203, Aug. 1985.
[28] A. J. Smith, "Cache evaluation and the impact of workload choice," inProc. 12th Annu. Symp. Comput. Architecture, Boston, MA, June 1985, pp. 64-73.
[29] H. E. Stanley and N. Ostrowsky,On Growth and Form, Fractal and Non-Fractal Patterns in Physics, NATO ASI Series. Boston, MA: Martinus Nijhoff, 1986.
[30] W. D. Strecker, "Transient behavior of cache memories,"ACM Trans. Comput. Syst., vol. 1, no. 4, pp. 281-293, Nov. 1983.
[31] D. F. Thiebaut and H. S. Stone, "Footprints in the cache,"ACM Trans. Comput. Syst., vol. 5, no. 4, pp. 305-329, Nov. 1987.
[32] D. Thiébaut, "From the fractal dimension of the intermiss gaps to the cache miss ratio," submitted for publication.
[33] D. Thiébaut, "Influence of program transients in computer cache memories, Ph.D. dissertation, Univ. of Massachusetts, Amherst, MA, Feb. 1988.
[34] I. L. Traiger and D. R. Slutz, "One-pass techniques for the evaluation of memory hierarchies," IBM Res. Rep. RJ892, (15563), pp. 1-18, July 1971.
[35] J. Voldman and L. W. Hoevel, "The software-cache connection,"IBM J. Res. Develop., vol. 25, pp. 877-893, Nov. 1981.
[36] J. Voldman, B. Mandelbrot, L. W. Hoevel, J. Knight, and P. Rosenfeld, "Fractal nature of software-cache interaction,"IBM J. Res. Develop., vol. 27, pp. 164-170, Mar. 1983.

Index Terms:
cache miss ratio prediction; fractal geometry; fractal dimension; computer programs; one-dimensional fractal random-walks; parameterization; trace-driven simulations; buffer storage; computational complexity; programming theory.
Citation:
D. Thiebaut, "On the Fractal Dimension of Computer Programs and its Application to the Prediction of the Cache Miss Ratio," IEEE Transactions on Computers, vol. 38, no. 7, pp. 1012-1026, July 1989, doi:10.1109/12.30852
Usage of this product signifies your acceptance of the Terms of Use.