On-line algorithms for cache sharing

Algorithms for Cache Sharing Daniel Greene * Arvind Raghunathan t A single physical computer memory may be used for more than one type of page, with the amount of memory devoted to each type under software control. For example, the effective size of memory can be increased by storing some pages in compressed form and decompressing on demand. This introduces another level to the memory hierarchy, and the sizes of two adjacent levels may be varied dynamically. We present an algorithm for varying the mixture of pages in a two-type cache, and then analyze the “competitiveness” of our algorithm. We also report progress in partially automating the design and analysis of on-line algorithms.

[1]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[2]  James A. Storer,et al.  Data Compression , 1992, Inf. Process. Manag..

[3]  Mark Taunton,et al.  Compressed Executables: An Exercise in Thinking Small , 1991, USENIX Summer.

[4]  Lyle A. McGeoch,et al.  Competitive Algorithms for Server Problems , 1990, J. Algorithms.

[5]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  Neal E. Young,et al.  On-line caching as cache size varies , 1991, SODA '91.

[7]  David L. Black,et al.  Competitive algorithms for replication and migration problems , 1989 .

[8]  Edward R. Fiala,et al.  Data compression with finite windows , 1989, CACM.

[9]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[10]  James A. Storer,et al.  Data Compression: Methods and Theory , 1987 .

[11]  Stephen Wolfram,et al.  Mathematica: a system for doing mathematics by computer (2nd ed.) , 1991 .

[12]  Anna R. Karlin,et al.  Competitive randomized algorithms for non-uniform problems , 1990, SODA '90.

[13]  Lawrence S. Kroll.  Mathematica--A System for Doing Mathematics by Computer. , 1989 .

[14]  G.G. Langdon,et al.  Data compression , 1988, IEEE Potentials.

[15]  Peter J. Denning,et al.  Working Sets Past and Present , 1980, IEEE Transactions on Software Engineering.

[16]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[17]  Allan Borodin,et al.  Competitive paging with locality of reference , 1991, STOC '91.

[18]  M. Luby,et al.  On ~ competitive algorithms for paging problems , 1991 .

[19]  Fred Douglis,et al.  The Compression Cache: Using On-line Compression to Extend Physical Memory , 1993, USENIX Winter.

[20]  P. Gács,et al.  Algorithms , 1992 .

[21]  Amos Fiat,et al.  Competitive Paging Algorithms , 1991, J. Algorithms.