This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Optimal Replacement of Nonuniform Cache Objects
August 2000 (vol. 49 no. 8)
pp. 769-778

Abstract—This paper studies a generalized version of the well-known page replacement problem. It assumes that page sizes and page fault penalties are nonuniform. This problem arises in distributed information systems, in particular the World Wide Web. It is shown that finding an optimal solution of this problem is an NP-complete problem. A dynamic programming algorithm that finds an optimal solution is presented. Since this algorithm is inefficient, we explore modified algorithms that allow a trade-off between optimality and speed.

[1] M. Abrams, C.R. Standridge, G. Abdulla, S. Williams, and E.A. Fox, “Caching Proxies: Limitations and Potentials,” Proc. Fourth Int'l World-Wide Web Conf., pp. 119-133, Dec. 1995.
[2] V.A. Aho, P.J. Denning, and J.D. Ullman, “Principles of Optimal Page Replacement,” J. ACM, vol. 18, no. 1, pp. 80-93, Jan. 1971.
[3] L.A. Belady, “A Study of Replacement Algorithms for a Virtual-Storage Computer,” IBM System J., vol. 5, no. 2, pp. 78-101, 1966.
[4] A. Bestavros, R.L. Carter, M.E. Crovella, C.R. Cunha, A. Heddaya, and S. Mirdad, Application-Level Document Caching in the Internet Proc. Second Int'l Workshop Services in Distributed and Networked Environments, 1995.
[5] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[6] A. Fiat, R. Karp, M. Luby, L.A. McGeoch, D. Sleator, and N.E. Yong, "Competitive Paging Algorithms," J. Algorithms, vol. 12, pp. 685-699, 1991
[7] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[8] S. Irani, “Page Replacement with Multisize Pages and Applications to Web Caching,” Proc. 29th Ann. ACM Symp. Theory of Computing, pp. 701-710, May 1997.
[9] C.H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1987.
[10] C.H. Papadimitriou, S. Ramanathan, and P. Venkat Rangan, Information Caching for Delivery of Personalized Video Data on Home Entertainment Channels Proc. IEEE Int'l Conf. Multimedia and Computing Systems, pp. 214-223, May 1994.
[11] P. Raghavan and M. Snir, “Memory Versus Randomization in On-Line Algorithms,” Automata, Languages and Programming: Proc. 16th Int'l Colloquium, pp. 687-703, July 1989.
[12] B. Sklar, Digital Communication: Fundamentals and Applications. Englewood Cliffs, N.J.: Prentice Hall, 1988.
[13] A.J. Smith, “Bibliography on Paging and Related Topics,” Operating Systems Review, vol. 12, pp. 39-56, Oct. 1978.
[14] A.J. Smith, “Bibliography and Readings on CPU Cache Memories,” Computer Architecture News, vol. 14, no. 1, pp. 22-42, Jan. 1986.
[15] A.J. Smith, "Second Bibliography on Cache Memories," Computer Architecture News, vol. 19, no. 4, pp. 154-182, June 1991.
[16] T. Stephenson and H. Voorhees, “IMACTS: An Interactive Multiterabyte Image Archive,” Proc. 14th IEEE Symp. Mass Storage Systems, 1995.
[17] D. Wessels and K. Claffy, “Evolution of the NLANR Cache Hierarchy: Global Configuration Challenges,” currently available at the web site of the Nat'l Laboratory for Applied Network Research (http://www.nlanr.net/PapersCache96/).
[18] S. Williams et al., "Removal Policies in Network Caches for World Wide Web Documents," Applications, Technologies, Architectures, and Protocols for Computer Communications, ACM Press, New York, 1996, pp. 293-305.
[19] R.P. Wooster and M. Abrams, "Proxy Caching That Estimates Page Load Delays," Computer Networks and ISDN Systems, vol. 29, nos. 8-13, 1997, pp. 977-986.

Index Terms:
Page replacement, generalized caching, optimal replacement.
Citation:
Saied Hosseini-Khayat, "On Optimal Replacement of Nonuniform Cache Objects," IEEE Transactions on Computers, vol. 49, no. 8, pp. 769-778, Aug. 2000, doi:10.1109/12.868024
Usage of this product signifies your acceptance of the Terms of Use.