
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J. van den Berg, D. Toswley, "Properties of the Miss Ratio for a 2Level Storage Model with LRU or FIFO Replacement Strategy and Independent References," IEEE Transactions on Computers, vol. 42, no. 4, pp. 508512, April, 1993.  
BibTex  x  
@article{ 10.1109/12.214697, author = {J. van den Berg and D. Toswley}, title = {Properties of the Miss Ratio for a 2Level Storage Model with LRU or FIFO Replacement Strategy and Independent References}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {4}, issn = {00189340}, year = {1993}, pages = {508512}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.214697}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Properties of the Miss Ratio for a 2Level Storage Model with LRU or FIFO Replacement Strategy and Independent References IS  4 SN  00189340 SP508 EP512 EPD  508512 A1  J. van den Berg, A1  D. Toswley, PY  1993 KW  miss ratio; 2level storage model; LRU; FIFO replacement strategy; independent references; least recently used; steadystate probability; convex function; Schurconvex function; reference probabilities; storage management. VL  42 JA  IEEE Transactions on Computers ER   
The behavior of a twolevel storage system operating with the least recently used (LRU) or the firstin, firstout (FIFO) replacement strategy, where accesses to the main storage are described by the independent reference model (IRM), is discussed. Let the size of main storage be m. It is proved that the miss ratio (i.e., the steadystate probability that the item currently required is not in main storage) exhibits the following properties: the miss ratio is a convex function of m under LRU, the function (1miss ratio)/m is nonincreasing in m under FIFO, and the miss ratio is a Schurconvex function of the reference probabilities under FIFO.
[1] O. I. Aven, E. G. Coffman, Jr., and Y. A. Kogan,Stochastic Analysis of Computer Storage. Reidel, 1987.
[2] O. I. Aven, L. B. Boguslavsky, and Y. A. Kogan, "Some results on distributionfree analysis of paging algorithms,"IEEE Trans. Comput., vol. C25, no. 7, pp. 737745, 1976.
[3] O.I. Aven and V. B. Sokolov, "On some methods of memory management,"Tech. Cybern., vol. 2, pp. 8994 (in Russian), 1971.
[4] A. Danet al., "The effect of skewed data access on buffer hits and data contention in a data sharing environment," inProc. 16th Int. Conf. Very Large Data Bases, pp. 419431, Aug. 1990.
[5] A. Dan, D. M. Dias, and P. S. Yu, "Modelling a hierarchical buffer for the data sharing environment," inACM SIGMETRICS, San Diego, CA, May 1991, pp. 156167.
[6] A. Dan and D. Towsley, "An approximate analysis of the LRU and FIFO buffer replacement schemes," inACM SIGMETRICS, Denver, CO, May 1990, pp. 143152.
[7] P. J. Denning, "Virtual memory,"ACM Comput. Surveys, vol. 2, pp. 153189, 1970.
[8] P. Flajolet, D. Gardy, and L. Thimonier, "Birthday paradox, coupon collectors, caching algorithms and self organizing search," Tech. Rep. 720 INRIA, Rocquencourt, France, Aug. 1987.
[9] C. M. Fortuin, P. W. Kasteleyn, and J. Ginibre, "Correlation inequalities on some partially ordered sets,"Commun. Mathematical Phys., vol. 22, pp. 89103, 1971.
[10] P. A. Franaszek and T. J. Wagner, "Some distributionfree aspects of paging algorithm performance,"J. ACM, vol. 21, pp. 3139, 1974.
[11] J.P. Kearns and S. DeFazio, "Diversity in Database Reference Behavior,"Performance Evaluation Review, Vol. 15, No. 1, May 1989, pp. 1119.
[12] W. F. King, "Analysis of paging algorithms," inProc. IFIP Cong., Lyublyana, Yugoslavia, Aug. 1971, pp. 485490.
[13] T. Lang and I. B. Fernandez, "Database buffer paging in virtual storage systems,"ACM Trans. Database Syst., vol. 2, pp. 339351, 1977.
[14] A. W. Marshall and I. Olkin,Inequalities: Theory of Majorization and its Applications.New York: Academic, 1979.
[15] A. Smith, "Cache Memories,"Computing Surveys, Vol. 14, No. 3, Sept. 1982, pp. 473 530.
[16] H. S. Stone, J. L. Wolf, and J. Turek, "Optimal partitioning of cache memory," IBM Res. Rep. RC14444 (64697), 1989; also inACM Trans. Comput. Syst., to be published.