Trace reduction for virtual memory simulations

Performance Evaluation Review

Volumn 27, Issue 1, 1999, Pages 47-49

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

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; COMPUTER SYSTEMS PROGRAMMING; RESPONSE TIME (COMPUTER SYSTEMS);

SAFELY ALLOWED DROP (SAD); STACK DELETION TECHNIQUES; TRACE REDUCTION;

VIRTUAL STORAGE;

EID: 0032690191     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/301464.301479     Document Type: Conference Paper

References (19)

1. A. Agarwal and M. Huffman, "Blocking: Exploiting spatial locality for trace compaction", Proc. SIGMETRICS '90, pp.48-57.
2. O. Babaoglu, "Efficient Generation of Memory Reference Strings Based on the LRU Stack Model of Program Behaviour", Proc. PERFORMANCE '81, pp.373-383.
3. O. Babaoglu and D. Ferrari, "Two-Level Replacement Decisions in Paging Stores", IEEE Transactions on Computers, 32(12) (1983).
4. E.G. Coffman and B. Randell, "Performance Predictions for Extended Paged Memories", Acta Informatica 1. pp.1-13 (1970).
5. P.J. Denning, "The Working Set Model for Program Behavior", CACM 19(5) pp.285-294 (1976)
6. E.B. Fernandez, T. Lang, and C. Wood, "Effect of Replacement Algorithms on a Paged Buffer Database System", IBM Journal of Research and Development, 22(2) pp.185-196 (1978).
7. G. Glass and P. Cao, "Adaptive Page Replacement Based on Memory Reference Behavior", Proc. SIGMETRICS '97.
8. E.E. Johnson and J. Ha, "PDATS: Lossless Address Trace Compression for Reducing File Size and Access Time", Proc. IEEE International Conference on Computers and Communications pp.213-219 (1994).
9. S.F. Kaplan, Y. Smaragdakis, and P. Wilson "Trace Reduction for Virtual Memory Simulations", UTexas CS Tech. Report 98-24.
10. D.C. Lee, P.J. Crowley, J.L. Baer, T.E. Anderson, and B.N. Bershad, "Execution Characteristics of Desktop Applications on Windows NT", Proc. Int. Symp. Comp. Arch. (ISCA) '98).
11. R.L. Mattson, J. Gecsei, D.R. Slutz, and I.L. Traiger, "Evaluation Techniques for Storage Hierarchies", IBM Systems Journal 9 pp.78-117 (1970).
12. T. Puzak, Analysis of Cache Replacement Algorithms, Ph.D. Dissertation, University of Massachusetts, 1985.
13. J.T. Robinson and M.V. Devarakonda, "Data Cache Management Using Frequency-Based Replacement", In Proc. SIGMETRICS (1990).
14. A.D. Samples, "Mache: No-Loss Trace Compaction", Proc. SIGMETRICS '89, pp.89-97.
15. Y. Smaragdakis, S.F. Kaplan, and P.R. Wilson, "EELRU: Simple and Efficient Adaptive Page Replacement", in the same Proceedings.
16. Y. Smaragdakis, "Trace Reduction for LRU-based Simulations", UTexas CS Tech. Report 98-25, revised version available at 〈http://www.cs.utexas.edu/users/smaragd/ research-html〉.
17. A.J. Smith, "Two Methods for the Efficient Analysis of Memory Address Trace Data", IEEE Transactions on Software Engineering SE-3(1) (1977).
18. R. Turner and H. Levy, "Segmented FIFO Page Replacement", In Proc. SIGMETRICS (1981).
19. R.A. Uhlig and T.N. Mudge, "Trace-Driven Memory Simulation: A Survey", ACM Computing Surveys 29(2), pp.128-170 (1997).