Flexible Reference Trace Reduction for VM Simulations

ACM Transactions on Modeling and Computer Simulation

Volumn 13, Issue 1, 2003, Pages 1-38

  Kaplan, Scott F ^a   Smaragdakis, Yannis ^b   Wilson, Paul R ^c  

^a AMHERST COLLEGE   (United States)

^b Georgia Institute of Technology   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Cache hierarchies; Locality; Reference traces; Trace compression; Trace reduction

Indexed keywords

CACHE HIERARCHIES; TRACE COMPRESSION; TRACE REDUCTION;

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTER PROGRAM LISTINGS; COMPUTER SIMULATION; VIRTUAL STORAGE;

CACHE MEMORY;

EID: 0348220543     PISSN: 10493301     EISSN: None     Source Type: Journal    
DOI: 10.1145/778553.778554     Document Type: Article

References (29)

1. AGARWAL, A. AND HUFFMAN, M. 1990. Blocking: Exploiting spatial locality for trace compaction. In Proceedings of ACM SIGMETRICS, 48-57.
2. BABAOGLU, O. 1981. Efficient generation of memory reference strings based on the LRU stack model of program behaviour. In Proceedings of PERFORMANCE '81, 373-383.
3. BABAOGLU, O. AND FERRARI, D. 1983. Two-level replacement decisions in paging stores. IEEE Trans. Comput. C-32, 12 (Dec.), 1151-1159.
4. BELADY, L. A. 1966. A study of replacement algorithms for virtual storage. IBM Syst. J. 5:78-101.
5. COFFMAN, E. G. AND RANDELL, B. 1970. Performance predictions for extended paged memories. Acta Inf. 1, 1-13.
6. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1989. Introduction to Algorithms. McGraw-Hill and MIT Press, New York.
7. DENNING, P. J. 1976. The working set model for program behavior. Commun. ACM 19, 5, 285-294.
8. DOUGLIS, P. 1993. The compression cache: Using on-line compression to extend physical memory. In Proceedings of 1993 Winter USENIX Conference (San Diego), 519-529.
9. FERNANDEZ, E. B., LANG, T., AND WOOD, C. 1978. Effect of replacement algorithms on a paged buffer database system. IBM Syst. J. 22, 2, 185-196.
10. GLASS, G. AND CAO, P. 1997. Adaptive page replacement based on memory reference behavior. In Proceedings of SIGMETRICS The 1997 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Vol. 25, ACM Press, New York, 115-126.
11. JOHNSON, E. E. AND HA, J. 1994. Pdats: Lossless address trace compression for reducing file size and access time. In Proceedings of the IEEE International Conference on Computers and Communications, 213-219.
12. KAPLAN, S. F. WWW trace reduction Web-page. Available at: 〈http://www.cs.amherst.edu/̃sfkaplan/research/trace-reduction〉.
13. KAPLAN, S. F. 1999. Compressed caching and modern virtual memory simulation. PhD thesis, Department of Computer Sciences, University of Texas at Austin.
14. KAPLAN, S. F., SMARAGDAKIS, Y., AND WILSON, P. R. 1999. Trace reduction for virtual memory simulations. In Proceedings of SIGMETRICS99. International Conference on Measurerment and Modeling of Computer Systems, 47-58.
15. LEE, D. C., CROWLEY, P. J., BAER, J. L., ANDBRSON, T. E., AND BERSHAD, B. N. 1998. Execution characteristics of desktop applications on windows NT. In Proceedings of the 25th Annual International Symposium on Computer Architecture, IEEE Computer Society Press, Los Alamitos, Ca.
16. MATTSON, R. L., GECSEI, J., SLUTZ, D. R., AND TRAIGER, I. L. 1970. Evaluation techniques for storage hierarchies. IBM Syst. J. 9, 78-117.
17. PHALKE, V. 1995. Modeling and managing program references in a memory hierarchy. PhD thesis, Rutgers University.
18. PRIEVE, B. G. AND FABRY, R. S. 1976. VMIN - an optimal variable space page-replacement algorithm. Commun. ACM 19, 5 (May), 295-297.
19. PUZAK, T. R. 1985. Analysis of cache replacement algorithms. PhD thesis, University of Massachusetts, Dept. of Electrical and Computer Engineering.
20. ROBERTSON, J. AND DEVARAKONDA, M. 1990. Data cache management using frequency-based replacement. In Proceedings of the SIGMETRICS International Conference on Measurement and Modeling of Computer Systems.
21. SAMPLES, A. D. 1989. Mache: No-loss trace compaction. In Proceedings of ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 89-97.
22. SIGMETRICS99 1999. The 1999 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, ACM Press, New York.
23. SMARAGDAKIS, Y. 1998. Optimal trace reduction for LRU-based simulations. Tech. Rep. 98-25, The University of Texas at Austin.
24. SMARAGDAKIS, Y., KAPLAN, S. F., AND WILSON, P. R. 1999. EELRU: Simple and efficient adaptive page replacement. In Proceedings of the SIGMETRICS99 International Conference on Measurement and Modeling of Computer Systems, 122-133.
25. SMITH, A. J. 1977. Two methods for the efficient analysis of address trace data. IEEE Trans. Softw. Eng. SE-3, 1 (Jan.).
26. TURNER, R. AND LEVY, H. 1981. Segmented FIFO page replacement. In Proceedings of SIGMETRICS The 1981 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, ACM Press, new York.
27. UHLIG, R. A. AND MUDGE, T. N. 1997. Trace-driven memory simulation: A survey. Comput. Surv. 29, 2, 128-170.
28. WILSON, P. R. 1991. Operating system support for small objects. In Proceedings of the International Workshop on Object Orientation in Operating Systems, IEEE Press, Palo Alto, CA, 80-86.
29. WILSON, P. R., KAPLAN, S. F., AND SMARAGDAKIS, Y. 1999. The case for compressed caching in virtual memory systems. In Proceedings of the 1999 USENIX Annual Technical Conference, USENIX Association (Monterey, CA), 101-116.