Practical Prefetching via Data Compression

ACM SIGMOD Record

Volumn 22, Issue 2, 1993, Pages 257-266

  Curewitz, Kenneth M ^a   Krishnan, P ^b   Vitter, Jeffrey Scott ^c  

^a HEWLETT PACKARD COMPANY   (United States)

^b BROWN UNIVERSITY   (United States)

^c DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; CACHE MEMORY; COMPUTER AIDED DESIGN; DATA COMPRESSION; ALGORITHMS; COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; DATA STRUCTURES; DATABASE SYSTEMS; PERFORMANCE; RESPONSE TIME (COMPUTER SYSTEMS); VIRTUAL STORAGE;

'CURRENT; CAD APPLICATIONS; DATA COMPRESSION TECHNIQUES; DATA COMPRESSOR; DETERMINISTICS; MOVING OBJECTS; PERFORMANCE; PREFETCHING; SIMPLE++; VIRTUAL MEMORY SYSTEMS;

HYPERTEXT SYSTEMS; DATA COMPRESSION;

CACHE REPLACEMENT; DATA COMPRESSOR; FAULT RATE; MEMORY SYSTEM; PREFETCHING;

EID: 0027621679     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/170036.170077     Document Type: Article

References (25)

1. L. A. Belady, “A Study of Replacement Algorithms for Virtual Storage Computers,” IBM Systems Journal 5 (1966), 78-101.
2. T. C. Bell, J. C. Cleary, and I. H. Witten, Text Compression, Prentice Hall Adv. Ref. Series, 1990.
3. J. T. Brady, “A theory of productivity in the creative process,” IEEE CG&A (May 1986), 25-34.
4. S. Bunton and G. Borriello, “Practical Dictionary Management for Hardware Data Compression,” Department of Computer Science, University of Washington, FR-35, 1991.
5. M. J. Carey, D. J. DeWitt, and J. F. Naughton, “The 007 Benchmark,” Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, this proceeding.
6. R. G. G. Cattell and J. Skeen, “Object Operations Benchmark,” ACM Transactions on Database Systems 17 (March 1992), 1-31.
7. T. F. Chen and J. L. Baer, “Reducing Memory Latency via Non-blocking and Prefetching Caches,” ASPLOS-V (October 1992).
8. A. Fiat, R. M. Karp, M. Luby, L. A. McGeoch, D. D. Sleator, and N. E. Young, “Competitive Paging Algorithms,” CMU, CS-88-196, November 1988.
9. J. Gray and A. Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufmann Publishers, Inc., 1993.
10. P. G. Howard and J. S. Vitter, “Analysis of Arithmetic Coding for Data Compression,” Information Processing and Management 28 (1992), 749-763, invited paper in special issue on data compression for images and texts.
11. A. R. Karlin, S. J. Phillips, and P. Raghavan, “Markov Paging,” Proceedings of the 33rd Annual IEEE Conference on Foundations of Computer Science (October 1992), 208-217.
12. D. F. Kotz and C. S. Ellis, “Prefetching in File Systems for MIMD Multiprocessors,” IEEE Transactions on Parallel and Distributed Systems 1 (April 1990), 218-230.
13. P. Krishnan and J. S. Vitter, “Optimal Prefetching in the Worst Case,” manuscript (November 1992).
14. P. Laird, “Discrete Sequence Prediction and its Applications,” AI Research Branch, NASA Ames Research Center, manuscript, 1992.
15. G. G. Langdon, “An Introduction to Arithmetic Coding,” IBM J. Res. Develop. 28 (March 1984), 135-149.
16. T. C. Mowry, M. S. Lam, and A. Gupta, “Design and Evaluation of a Compiler Algorithm for Prefetching,” ASPLOS-V (October 1992).
17. M. Palmer and S. Zdonik, “Predictive Caching,” Brown University, CS-90-29, November 1990.
18. M. Palmer and S. Zdonik, “Fido: A Cache that Learns to Fetch,” Proceedings of the 1991 International Conference on Very Large Databases (September 1991).
19. A. Rogers and K. Li, “Software Support for Speculative Loads,” ASPLOS-V (October 1992).
20. K. Salem, “Adaptive Prefetching for Disk Buffers,” CESDIS, Goddard Space Flight Center, TR-91-64, January 1991.
21. J. A. Storer, Data Compression Methods and Theory, Computer Science Press, 1988.
22. M. M. Tsangaris and J. F. Naughton, “On the Performance of Object Clustering Techniques,” Proc. of the 1992 ACM SIGMOD International Conference on Management of Data (June 1992), 144-153.
23. J. S. Vitter and P. Krishnan, “Optimal Prefetching via Data Compression,” Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (October 1991), 121-130, also appears as Brown Univ. Tech. Rep. No. CS-91-46.
24. I. H. Witten, R. M. Neal, and J. G. Cleary, “Arithmetic Coding for Data Compression,” Communications of the ACM 30 (June 1987), 520-540.
25. J. Ziv and A. Lempel, “Compression of Individual Sequences via Variable-Rate Coding,” IEEE Transactions on Information Theory 24 (September 1978), 530-536.