메뉴 건너뛰기




Volumn , Issue , 2012, Pages 293-304

Introducing hierarchy-awareness in replacement and bypass algorithms for last-level caches

Author keywords

Bypass algorithm; Last level caches; Replacement policy

Indexed keywords

ACCESS PATTERNS; AVERAGE THROUGHPUT; CACHE HIERARCHIES; DATA TRANSACTION; EFFECTIVE ALGORITHMS; HARD COPIES; INTERVAL PREDICTION; L2 CACHE; LAST-LEVEL CACHES; PARALLEL EXECUTIONS; REPLACEMENT ALGORITHM; REPLACEMENT POLICY; SHARED MEMORIES; SINGLE-THREADED; THREE-LEVEL;

EID: 84867490427     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2370816.2370860     Document Type: Conference Paper
Times cited : (52)

References (27)
  • 1
    • 0003003638 scopus 로고
    • A study of replacement algorithms for a virtual-storage computer
    • L. A. Belady. A Study of Replacement Algorithms for a Virtual-storage Computer. In IBM Systems Journal, 5(2): 78-101, 1966.
    • (1966) IBM Systems Journal , vol.5 , Issue.2 , pp. 78-101
    • Belady, L.A.1
  • 2
    • 76749083861 scopus 로고    scopus 로고
    • Pseudo-LIFO: The foundation of a new family of replacement policies for last-level caches
    • December
    • M. Chaudhuri. Pseudo-LIFO: The Foundation of a New Family of Replacement Policies for Last-level Caches. In Proceedings of the 42nd International Symposium on Microarchitecture, pages 401-412, December 2009.
    • (2009) Proceedings of the 42nd International Symposium on Microarchitecture , pp. 401-412
    • Chaudhuri, M.1
  • 3
    • 20744449792 scopus 로고    scopus 로고
    • The design and implementation of FFTW3
    • February
    • M. Frigo and S. G. Johnson. The Design and Implementation of FFTW3. In Proceedings of the IEEE, 93(2): 216-231, February 2005.
    • (2005) Proceedings of the IEEE , vol.93 , Issue.2 , pp. 216-231
    • Frigo, M.1    Johnson, S.G.2
  • 14
    • 41149104074 scopus 로고    scopus 로고
    • Counter-based cache replacement and bypassing algorithms
    • April
    • M. Kharbutli and Y. Solihin. Counter-based Cache Replacement and Bypassing Algorithms. In IEEE Transactions on Computers, 57(4): 433-447, April 2008.
    • (2008) IEEE Transactions on Computers , vol.57 , Issue.4 , pp. 433-447
    • Kharbutli, M.1    Solihin, Y.2
  • 15
    • 85008031236 scopus 로고    scopus 로고
    • MinneSPEC: A new SPEC benchmark workload for simulation-based computer architecture research
    • January
    • A. J. KleinOsowski and D. J. Lilja. MinneSPEC: A New SPEC Benchmark Workload for Simulation-Based Computer Architecture Research. In Computer Architecture Letters, 1(1), January 2002.
    • (2002) Computer Architecture Letters , vol.1 , Issue.1
    • Kleinosowski, A.J.1    Lilja, D.J.2
  • 18
    • 66749155879 scopus 로고    scopus 로고
    • Cache bursts: A new approach for eliminating dead blocks and increasing cache efficiency
    • November
    • H. Liu et al. Cache Bursts: A New Approach for Eliminating Dead Blocks and Increasing Cache Efficiency. In Proceedings of the 41st International Symposium on Microarchitecture, pages 222-233, November 2008.
    • (2008) Proceedings of the 41st International Symposium on Microarchitecture , pp. 222-233
    • Liu, H.1
  • 20
    • 0014701246 scopus 로고
    • Evaluation techniques for storage hierarchies
    • R. L. Mattson et al. Evaluation Techniques for Storage Hierarchies. In IBM Systems Journal, 9(2): 78-117, 1970.
    • (1970) IBM Systems Journal , vol.9 , Issue.2 , pp. 78-117
    • Mattson, R.L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.