Inter-reference gap distribution replacement: An improved replacement algorithm for set-associative caches

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2004, Pages 20-30

  Takagi, Masamichi ^a   Hiraki, Kei ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Cache memory; Replacement algorithm; Set associative cache

Indexed keywords

INTER-REFERENCE GAP DISTRIBUTION REPLACEMENT (IGDR); REPLACEMENT ALGORITHMS; SET-ASSOCIATIVE CACHE; WEIGHT ESTIMATION;

ALGORITHMS; COMPUTER SIMULATION; FUNCTIONS; NUMBER THEORY; PROBABILITY; STATISTICS;

BUFFER STORAGE;

EID: 8344233359     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. A. V. Aho, P. J. Denning, and J. D. Ullman. Principles of optimal page replacement. J. of ACM, 18(1):80-93, 1971.
2. L. A. Belady. A study of replacement algorithms for virtual storage computers. IBM Sys. J., 5(2):78-101, 1966.
3. J. Choi, S. H. Noh, S. L. Min, and Y. Cho. Towards application/file-level characterization of block references: A case for fine-grained buffer management. In Proc. ACM BIOMETRICS Conf., pages 286-295, June 2000.
4. J. E. G. Coffman and P. J. Denning. Operating Systems Theory. Prentice-Hall, Englewood Cliffs, 1973.
5. S. Jiang and X. Zhang. Lirs: An efficient low inter-reference recency set replacement policy to improve buffer cache performance. In Proc. ACM BIOMETRICS Conf., 2002.
6. T. Johnson and D. Shasha. 2q: A low overhead high performance buffer management replacement algorithm. In Proc. the 20th Int'l Conf. on VLDB, pages 439-450, 1994.
7. C. Kim, D. Burger, and S. W. Keckler. An adaptive, non-uniform cache structure for wire-delay dominated on-chip caches. In Proc. ASPLOS, pages 211-222, Oct. 2002.
8. J. M. Kim, J. Choi, J. Kim, S. H. Noh, S. L. Min, Y. Cho, and C. S. Kim. A low-overhead, high-performance unified buffer management scheme that exploits sequential and looping references. In Proc. the 4th USENIX Symp. on Operating System Design and Implementation, pages 119-134, Oct. 2000.
9. D. Lee, J. Choi, J.-H. Kim, S. H. Noh, S. L. Min, Y. Cho, and C. S. Kim. Lrfu: A spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Trans. on Computers, 50(12):1352-1360, 2001.
10. N. Megiddo and D. S. Modha. Arc: A self-tuning, low overhead replacement cache. In Proc. the 2nd USENIX Conf. on File and Storage Technologies (FAST 03), Mar. 2003.
11. E. J. O'Neil, P. E. O'Neil, and G. Weikum. The lru-k page replacement algorithm for database disk buffering. In Proc. ACM SIGMOD Conf., pages 297-306, 1993.
12. V. Phalke and B. Gopinath. An inter-reference gap model for temporal locality in program behavior. In Proc. BIOMETRICS Conf., pages 291-300, 1995.
13. J. T. Robinson and M. V. Devarakonda. Data cache management using frequency-based replacement. In Proc. BIOMETRICS Conf., pages 134-142, 1990.
14. J. Schauer. Opensource floating point adder, May 2002. http://www.hmc.edu/chips.
15. G. S. Shedler and C. Tung. Locality in page reference strings. SIAM J. on Computing, 1:218-241, Sept. 1972.
16. P. Shivakumar and N. Jouppi. Cacti 3.0: an integrated cache timing, power, and area model. Technical Report 2001/2, Compaq WRL, Aug. 2001.
17. M. Takagi. Improving Cache Performance by Exploiting Redundancy, Temporal Affinity, and Reuse of Data. PhD thesis, Univ. of Tokyo, Dec. 2003.
18. M. Uya, K. Kaneko, and J. Yasui. A cmos floating point multiplier. IEEE J. of Solid-Sate Circuits, 19(5):697-702, Oct. 1984.
19. W. A. Wulf and S. A. McKee. Hitting the memory wall: Implications of the obvious. Computer Architecture News, 23(1):20-24, Mar. 1995.
20. Y. Zhou, J. F. Philbin, and K. Li. The multi-queue replacement algorithm for secondary level buffer caches. In Proc. USENIX Technical Conf., June 2001.