메뉴 건너뛰기




Volumn , Issue , 2010, Pages 175-186

Sampling dead block prediction for last-level caches

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK REPLACEMENT; CACHE BLOCKS; DYNAMIC POWER; GEOMETRIC MEAN; IMPROVE-A; LARGE STRUCTURES; LEAKAGE POWER; MULTI CORE; POWER REQUIREMENT; PROGRAM COUNTERS; REDUCED-STATE; REPLACEMENT POLICY;

EID: 79951697650     PISSN: 10724451     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MICRO.2010.24     Document Type: Conference Paper
Times cited : (185)

References (25)
  • 3
    • 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. IBM Systems Journal, 5(2):78-101, 1966.
    • (1966) IBM Systems Journal , vol.5 , Issue.2 , pp. 78-101
    • Belady, L.A.1
  • 4
    • 0010232351 scopus 로고
    • The declining effectiveness of dynamic caching for general-purpose microprocessors
    • D. Burger, J. R. Goodman, and A. Kagi. The declining effectiveness of dynamic caching for general-purpose microprocessors. Technical Report 1261, 1995.
    • (1995) Technical Report , vol.1261
    • Burger, D.1    Goodman, J.R.2    Kagi, A.3
  • 9
    • 52949085794 scopus 로고    scopus 로고
    • Cache replacement based on reuse-distance prediction
    • Georgios Keramidas, Pavlos Petoumenos, and Stefanos Kaxiras. Cache replacement based on reuse-distance prediction. In ICCD, pages 245-250, 2007.
    • (2007) ICCD , pp. 245-250
    • Keramidas, G.1    Petoumenos, P.2    Kaxiras, S.3
  • 11
    • 41149104074 scopus 로고    scopus 로고
    • Counter-based cache replacement and bypassing algorithms
    • DOI 10.1109/TC.2007.70816
    • Mazen Kharbutli and Yan Solihin. Counter-based cache replacement and bypassing algorithms. IEEE Transactions on Computers, 57(4):433-447, 2008. (Pubitemid 351423979)
    • (2008) IEEE Transactions on Computers , vol.57 , Issue.4 , pp. 433-447
    • Kharbutli, M.1    Solihin, Y.2
  • 12
    • 0033691729 scopus 로고    scopus 로고
    • Selective, accurate, and timely selfinvalidation using last-touch prediction
    • An-Chow Lai and Babak Falsafi. Selective, accurate, and timely selfinvalidation using last-touch prediction. In International Symposium on Computer Architecture, pages 139-148, 2000.
    • (2000) International Symposium on Computer Architecture , pp. 139-148
    • Lai, A.-C.1    Falsafi, B.2
  • 14
    • 0029202473 scopus 로고
    • Dynamic self-invalidation: Reducing coherence overhead in shared-memory multiprocessors
    • Alvin R. Lebeck and David A. Wood. Dynamic self-invalidation: reducing coherence overhead in shared-memory multiprocessors. SIGARCH Comput. Archit. News, 23(2):48-59, 1995.
    • (1995) SIGARCH Comput. Archit. News , vol.23 , Issue.2 , pp. 48-59
    • Lebeck, A.R.1    Wood, D.A.2
  • 15
    • 66749155879 scopus 로고    scopus 로고
    • Cache bursts: A new approach for eliminating dead blocks and increasing cache efficiency
    • Los Alamitos, CA, USA. IEEE Computer Society
    • Haiming Liu, Michael Ferdman, Jaehyuk Huh, and Doug Burger. Cache bursts: A new approach for eliminating dead blocks and increasing cache efficiency. In Proceedings of the IEEE/ACM International Symposium on Microarchitecture, pages 222-233, Los Alamitos, CA, USA, 2008. IEEE Computer Society.
    • (2008) Proceedings of the IEEE/ACM International Symposium on Microarchitecture , pp. 222-233
    • Liu, H.1    Ferdman, M.2    Huh, J.3    Burger, D.4


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