Optimal prefetching via data compression

Journal of the ACM

Volumn 43, Issue 5, 1996, Pages 771-793

  Vitter, Jeffrey Scott ^a,c   Krishnan, P ^b  

^a DUKE UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c Duke University   (United States)

Author keywords

Algorithms; Caching; Competitive analysis; Data compression; Databases; Design; Fault rate; Hypertext; Markov source; Performance; Prediction; Prefetching; Secondary stage; Theory; Universal prefetcher

Indexed keywords

ALGORITHMS; BUFFER STORAGE; DATA ACQUISITION; DATABASE SYSTEMS; MARKOV PROCESSES; MATHEMATICAL MODELS;

CACHING; FAULT RATE; HYPERTEXT SYSTEMS; OPTIMAL UNIVERSAL PREFETCHER;

DATA COMPRESSION;

EID: 0030230390     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/234752.234753     Document Type: Review

References (39)

1. ABE, N., AND WARMUTH, M. 1990. On the computational complexity of approximating distributions by probabilistic automata. UCSC, UCSC-CRL-90-63.
2. AMIT, Y., AND MILLER, M. 1990. Large deviations for coding Markov chains and Gibbs random fields. Tech. Rep. Washington Univ.
3. BELL, T. C., CLEARY, J. C., AND WITTEN, I. H. 1990. Text Compression. Prentice-Hall Advanced Reference Series. Prentice-Hall, Englewood Cliffs, N.J.
4. BLACKWELL, D. 1956. An analog to the minimax theorem for vector payoffs. Pac. J. Math. 6, 1-8.
5. BLUMER, A., EHRENFEUCHT, A., HAUSSLER, D., AND WARMUTH, M. K. 1987. Occam's razor. Inf. Proc. Lett. 24, 377-380.
6. BLUMER, A., EHRENFEUCHT, A., HAUSSLER, D., AND WARMUTH, M. K. 1989. Learnability and the Vapnik - Chervonenkis dimension. J. ACM 36, 4 (Oct.), 929-965.
7. BOARD, R., AND PITT, L. 1990. On the necessity of occam algorithms. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computation (Baltimore, Md., May 14-16). ACM, New York, pp. 54-63.
8. BORODIN, A., IRANI, S., RAGHAVAN, P., AND SCHIEBER, B. 1991. Competitive paging with locality of reference. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computation (New Orleans, La., May 6-8). ACM, New York, pp. 249-259.
9. BRADY, J. T. 1986. A theory of productivity in the creative process. IEEE CG&A (May), 25-34.
10. CHEN, T. F., AND BAER, J. L. 1992. Reducing memory latency via non-blocking and prefetching caches. In Proceedings of the 5th International Conference on Architectural Support for Programming Languages and Operating Systems (Boston, Mass., Oct.). ACM, New York, pp. 51-61.
11. COVER, T. M., AND SHENHAR, A. 1977. Compound Bayes predictors with apparent Markov structure. IEEE Trans. Syst. Man Cyb. SMC-7 (June), 421-424.
12. CUREWITZ, K. M., KRISHNAN, P., AND VITTER, J. S. 1993. Practical prefetching via data compression. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (Washington, D.C., May 26-28). ACM, New York, pp. 257-266.
13. FEDER, M., MERHAV, N., AND GUTMAN, M. 1992. Universal prediction of individual sequences. IEEE Trans. Inf. Theory IT-38 (July), 1258-1270.
14. FIAT, A., KARP, R. M., LUBY, M., MCGEOCH, L. A., SLEATOR, D. D., AND YOUNG, N. E. 1991. On competitive algorithms for paging problems. J. Algorithms 12, 685-699.
15. GALLAGER, R. G. 1968. Information Theory and Reliable Communication. Wiley, New York.
16. HANNAN, J. F. 1957. Approximation to Bayes risk in repeated plays. In Contributions to the Theory of Games, Vol. 3, Annals of Mathematical Studies. Princeton, N.J., 97-139.
17. HOWARD, P. G., AND VITTER, J. S. 1992. Analysis of arithmetic coding for data compression. Inf. Proc. Man. 28, 749-763 (invited paper in Special Issue on Data Compression for Images and Texts).
18. IRANI, S., KARLIN, A. R., AND PHILLIPS, S. 1992. Strongly competitive algorithms for paging with locality of reference. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (Orlando, Fla., Jan. 27-29). ACM, New York, pp. 228-236.
19. KARLIN, A. R., PHILLIPS, S. J., AND RAGHAVAN, P. 1992. Markov paging. In Proceedings of the 33rd Annual IEEE Conference on Foundations of Computer Science (Oct.). IEEE, New York, pp. 208-217.
20. KARLIN, S., AND TAYLOR, H. M. 1975. A First Course in Stochastic Processes, 2nd ed., Academic Press, New York.
21. KEARNS, M. J., AND SCHAPIRE, R. E. 1990. Efficient distribution-free learning of probabilistic concepts. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (Oct.). IEEE, New York, pp. 382-391.
22. KRISHNAN, P., AND VITTER, J. S. 1996. Optimal prediction for prefetching in the worst case. SIAM J. Comput. to appear. (A shortened version appears in Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, Jan. 1994. ACM, New York, pp. 372-401.)
23. KRISHNAN, P., AND VITTER, J. S. 1996. Optimal prediction for prefetching in the worst case. SIAM J. Comput. to appear. (A shortened version appears in Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, Jan. 1994. ACM, New York, pp. 372-401.)
24. LAIRD, P. 1992. Discrete sequence prediction and its applications. AI Research Branch, NASA Ames Research Center, Moffet Field, Calif.
25. LANGDON, G. G. 1983. A note on the Ziv-Lempel model for compressing individual sequences. IEEE Trans. Inf. Theory 29 (Mar.), 284-287.
26. LANGDON, G. G. 1984. An introduction to arithmetic coding. IBM J. Res. Develop. 28 (Mar.), 135-149.
27. LEMPEL, A., AND ZIV, J. 1976. On the complexity of finite sequences. IEEE Trans. Inf. Theory IT-22, 1 (Jan.), 75-81.
28. MCGEOCH, L. A., AND SLEATOR, D. D. 1989. A strongly competitive randomized paging algorithm. CS-89-122. Carnegie-Mellon Univ., Pittsburgh, Pa.
29. MOWRY, T. C., LAM, M. S., AND GUPTA, A. 1992. Design and evaluation of a compiler algorithm for prefetching. In Proceedings of the 5th International Conference on Architectural Support for Programming Languages and Operating Systems (Boston, Mass., Oct.). ACM, New York, pp. 62-73.
30. PALMER, M., AND ZDONIK, S. 1991. Fido: A cache that learns to fetch. In Proceedings of the 1991 International Conference on Very Large Databases (Barcelona, Spain, Sept.). Morgan-Kaufmann, San Mateo, Calif., pp. 255-264.
31. PATTERSON, R. H., GIBSON, G. A., AND SATYANARAYANAN, M. 1993. A status report on research in transparent informed prefetching. ACM Oper. Syst. Rev. 27, (Apr.), 21-34.
32. ROGERS, A., AND LI, K. 1992. Software support for speculative loads. In Proceedings of the 5th International Conference on Architectural Support for Programming Languages and Operating Systems (Boston, Mass., Oct.). ACM, New York, pp. 38-50.
33. SHWARTZ, A., AND WEISS, A. 1995. Large Deviations for Performance Analysis. Chapman & Hall, New York.
34. SLEATOR, D. D., AND TARJAN, R. E. 1985. Amortized efficiency of list update and paging rules. Commun. ACM 28, 2 (Feb.), 202-208.
35. TRIVEDI, K. S. 1979. An analysis of prepaging. Computing 22, 191-210.
36. VAPNIK, V. 1982. Estimation of Dependencies Based on Empirical Data. Springer-Verlag, New York.
37. VITTER, J. S., CUREWITZ, K., AND KRISHNAN, P. 1996. Online background predictors and prefetchers. Duke Univ., United States Patent No. 5,485,609.
38. WITTEN, I. H., NEAL, R. M., AND CLEARY, J. G. 1987, Arithmetic coding for data compression. Commun. ACM 30, 6 (June), 520-540.
39. ZIV, J., AND LEMPEL, A. 1978. Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory 24 (Sept.), 530-536.