This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improving Disk Cache Hit-Ratios Through Cache Partitioning
June 1992 (vol. 41 no. 6)
pp. 665-676

An adaptive algorithm for managing fully associative cache memories shared by several identifiable processes is presented. The on-line algorithm extends an earlier model due to H.S. Stone et al. (1989) and partitions the cache storage in disjoint blocks whose sizes are determined by the locality of the processes accessing the cache. Simulation results of traces for 32-MB disk caches show a relative improvement in the overall and read hit-ratios in the range of 1% to 2% over those generated by a conventional least recently used replacement algorithm. The analysis of a queuing network model shows that such an increase in hit-ratio in a system with a heavy throughput of I/O requests can provide a significant decrease in disk response time.

[1] L. A. Belady and C. J. Kuehner, "Dynamic space sharing in computer system,"Commun. ACM, vol. 12, pp. 282-288, May 1969.
[2] J. L. Bentley and C. McGeoch, "Worst-case analysis of self-organizing sequential search heuristics," inProc. of 20th Allerton Conf. Commun., Contr., Comput., Univ. of Illinois, Urbana-Champaign, Oct. 6-8, 1982, pp. 452-461, 1983.
[3] A. Brandwajn and J. Hernandez, "A study of a mechanism for controlling multiprogrammed memory in an interactive system,"IEEE Trans. Software Eng., vol. SE-7, pp. 321-331, May 1981.
[4] D. D. Chamberlin, S. H. Fuller, and L. Y. Liu, "An analysis of page allocation strategies for multiprogramming systems with virtual memory,"IBM J. Res. Develop., pp. 403-411, Sept. 1973.
[5] W. W. Chu and H. Opderbeck, "The page fault frequency replacement algorithm," inAFIPS Conf. Proc. Fall Joint Comput. Conf., vol. 41, 1972, pp. 597-608.
[6] P. Denning, K. C. Kahn, J. Leroudier, D. Potier, and R. Suri, "Optimal multiprogramming,"Acta Informatica, vol. 7, pp. 197-216, 1976.
[7] T. Ibaraki and N. Katoh,Resource Allocation Problems. Cambridge, MA: MIT Press, 1988.
[8] IBM Corp.,IBM System/370: Principles of Operation, GA22-7000-9, May 1983.
[9] R. Fagin, "Asymptotic miss ratio over independent references,"J. Comput. Syst. Sci., vol. 14, pp. 222-250, 1977.
[10] M. Z. Ghanem, "Dynamic partitioning of the main memory using the working set concept,"IBM J. Res. Develop., pp. 445-450, Sept. 1975.
[11] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[12] T. Puzak, "An analysis of cache replacement algorithms," Ph.D. dissertation., Univ. of Massachusetts, Feb. 1985.
[13] A. Smith, "Cache Memories,"Computing Surveys, Vol. 14, No. 3, Sept. 1982, pp. 473- 530.
[14] A. J. Smith, "Disk cache-miss ratio analysis and design considerations,"ACM Trans. Comput. Syst., vol. 3, no. 3, pp. 161-203, Aug. 1985.
[15] H. S. Stone, J. L. Wolf, and J. Turek, "Optimal partitioning of cache memory," IBM Res. Rep. RC14444(#64697), pp. 1-25, Mar. 1989.
[16] D. Thiébaut, "Influence of program transients in computer cache memories, Ph.D. dissertation, Univ. of Massachusetts, Amherst, MA, Feb. 1988.
[17] D. Thiébaut, H. S. Stone, and J. L. Wolf, "Synthetic traces for trace-driven simulation of cache memories," IBM Res. Rep. RC14268, (#63748), Dec. 1988, pp. 1-49.
[18] J. L. Wolf, "The placement optimization program: A practical solution to the disk file assignment problem," inProc. Sigmetrics Conf., Berkeley, CA, 1989.
[19] J. L. Wolf, B. R. Iyer, K. R. Pattipati, and J. Turek, "Optimal buffer partitioning for the nested block join algorithm," inProc. Seventh Int. Conf. Data Eng., Kobe, Japan, Apr. 1991, pp. 510-519.
[20] J. L. Wolf, D. Dias, and P. S. Yu, "An effective algorithm for parallelizing sort merge joins in the presence of data skew," inProc. Second Int. Conf. Databases in Parallel and Distributed Syst., Dublin, Ireland, July 1990, pp. 103-115.
[21] G. K. Zipf,Human Behavior and the Principle of Least Effort. Reading, MA: Addison-Wesley, 1949.
[22] D. D. Sleator and R. E. Tarjan, "Amortized efficiency of list update and paging rules,"Commun. ACM, vol. 28, no. 2, pp. 202-208, Feb. 1985.

Index Terms:
disk cache; hit-ratios; cache partitioning; adaptive algorithm; fully associative cache memories; cache storage; queuing network model; buffer storage; content-addressable storage; magnetic disc storage.
Citation:
D. Thiebaut, H.S. Stone, J.L. Wolf, "Improving Disk Cache Hit-Ratios Through Cache Partitioning," IEEE Transactions on Computers, vol. 41, no. 6, pp. 665-676, June 1992, doi:10.1109/12.144619
Usage of this product signifies your acceptance of the Terms of Use.