An inter-reference gap model for temporal locality in program behavior

Proceedings of the 1995 ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1995/PERFORMANCE 1995

Volumn , Issue , 1995, Pages 291-300

  Phalke, Vidyadhar ^a   Gopinath, Bhaskarpillai ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Dynamic memory management; Locality of reference; Markov chains; Memory replacement; Prediction; Trace compaction; Trace driven simulation

Indexed keywords

CHAINS; COMPACTION; FORECASTING; JOINT PROSTHESES; MARKOV PROCESSES; MULTIPROGRAMMING; OPTIMIZATION; STORAGE ALLOCATION (COMPUTER);

DYNAMIC MEMORY MANAGEMENT; LEAST RECENTLY USED; LOCALITY OF REFERENCE; PRODUCT IMPROVEMENT; REPLACEMENT ALGORITHM; TRACE COMPACTIONS; TRACE COMPRESSION; TRACE DRIVEN SIMULATION;

APPLICATION PROGRAMS;

EID: 84967068696     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/223587.223620     Document Type: Conference Paper

References (33)

1. O. Aven, L. Boguslavsky, and Y. Kogan. Some results on distribution-free analysis of paging algorithms. IEEE Transactions on Computers, 25(7), July 1976.
2. A. Batson. Program behavior at the symbolic level. Computer, pages 21-26, Nov. 1976.
3. R. Budzinski, E. Davidson, W. Mayeda, and H. Stone. DMIN: an algorithm for computing the optimal dynamic allocation in a virtual memory computer. IEEE Transactions on Software Engineering, SE-7(1), Jan. 1981.
4. T. Chen and J. Baer. Reducing memory latency via nonblocking and prefetching caches. ASPLOS-V, Oct. 1992.
5. A. Choi and M. Ruschitzka. Managing locality sets: The model and fixed-size buffers. IEEE Transactions on Computers, 42(2), Feb. 1993.
6. W. W. Chu and H. Opderbeck. Program behavior and the page-fault-frequency replacement algorithm. Computer, pages 29-38, Nov. 1976.
7. P. Denning. Working sets past and present. IEEE Transactions on Software Engineering, SE-6, Jan. 1980.
8. P. J. Denning and G. S. Graham. Multiprogrammed memory management. In Proceedings of the IEEE, June 1975.
9. M. Easton. Cold-start vs. warm-start miss ratio. Communications of the ACM, 21, Oct. 1978.
10. J. Flanagan, B. Nelson, J. Archibald, and K. Grimsrud. BACH: BYU address collection hardware; the collection of complete traces. In International Workshop on Modeling Techniques and Tools for Computer Performance Evaluation, Sept. 1992.
11. M. Franklin and R. Gupta. Computation of pf probabilities from program transition diagrams. Communications of the ACM, 17:186-191, 1974.
12. E. Gelenbe. A unified approach to the evaluation of a class of replacement algorithms. IEEE Transactions on Computers, C-22(6), June 1973.
13. J. L. Hennessy and D. A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufman, 1990.
14. W. King. Analysis of paging algorithms. In Proceedings of IFIP Congress, Ljublanjana, Yugoslavia, Aug. 1971.
15. A. Madison and A. Batson. Characteristics of program localities. Communications of the ACM, 19, May 1976.
16. S. Majumdar and R. Bunt. Measurement and analysis of locality phases in file referencing behaviour. In Proceedings of Performance '86 and ACM SIGMETRICS 1986 Joint Conference on Computer Performance Modeling, Measurement and Evaluation, pages 180-192, May 1986.
17. R. Mattson, J. Gecsei, D. Slutz, and I. Traiger. Evaluation techniques and storage hierarchies. IBM Systems Journal, 9:78-117, 1970.
18. A. Mendelson, D. Thiebaut, and D. L. Pradhan. Modeling live and dead lines in cache memory systems. IEEE Transactions on Computers, 42(1), Jan. 1993.
19. E. J. O'Neil, P. E. O'Neil, and G. Weikum. The LRU-K page replacement algorithm for database disk buffering. In Proceedings of 1993 ACM SIGMOD, June 1993.
20. H. Opderbeck and W. Chu. The renewal model for program behavior. SIAM Journal of Computing, 4:356-374, 1975.
21. V. Phalke and B. Gopinath. An inter-reference gap model for temporal locality in program behavior. Technical Report DCS-TR-315, Department of Computer Science, Rutgers University, NJ, 1994.
22. B. Prieve and R. Fabry. VMIN - an optimal variable-space page replacement algorithm. Communications of the ACM, 19(5), May 1976.
23. J. Rissanen. A universal data compression system. IEEE Transactions on Information Theory, IT-29(5), Sept. 1983.
24. J. T. Robinson and M. V. Devarakonda. Data cache management using frequency-based replacement. In Proceedings of1990 ACM SIGMETRICS Conference on Measurement & Modeling of Computer Systems, May 1990.
25. G. Shedler and C. Tung. Locality in page reference strings. SIAM Journal of Computing, 1(3), Sept. 1972.
26. J. P. Singh, H. S. Stone, and D. F. Thiebaut. A model of workloads and its use in miss-rate prediction for fully associative caches. IEEE Transactions on Computers, 41(7), July 1992.
27. A. Smith. A modified working set paging algorithm. IEEE Transactions on Computers, 25(9), Sept. 1976.
28. A. J. Smith. Analysis of optimal look-ahead demand paging algorithms. SIAM Journal of Computing, 5(4), Dec. 1976.
29. A. J. Smith. Two methods for the efficient analysis of memory address trace data. IEEE Transactions on Software Engineering, SE-3(1), Jan. 1977.
30. J. Spirn. Program Locality and Dynamic Memory Management. PhD thesis. Princeton University, 1973.
31. J. Storer. Data Compression methods and theory. Computer Science Press, MD, 1988.
32. D. Thiebaut. On the fractal dimension of computer programs and it s application to the prediction of the cache miss ratio. IEEE Transactions on Computers, 38(7), July 1989.
33. A. Verkamo. Empirical results on locality in database referencing. In Proceedings of 1985 ACM SIGMETRICS Conference on Measurement & Modeling of Computer Systems, Aug. 1985.