메뉴 건너뛰기




Volumn , Issue , 2004, Pages 19-24

SF-LRU cache replacement algorithm

Author keywords

LFU; Low Power Cache; LRU; Replacement

Indexed keywords

LEAST FREQUENTLY USED (LFU); LEAST RECENTLY USED (LRU); LOW POWER CACHE; REPLACEMENT;

EID: 10044286074     PISSN: 10874852     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MTDT.2004.1327979     Document Type: Conference Paper
Times cited : (46)

References (13)
  • 1
  • 5
    • 0035693331 scopus 로고    scopus 로고
    • LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies
    • Lee, D., et. al., LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies, IEEE Transaction on Computers, vol. 50, no. 12, pp. 1352-1361, 2001.
    • (2001) IEEE Transaction on Computers , vol.50 , Issue.12 , pp. 1352-1361
    • Lee, D.1
  • 11
    • 1542329218 scopus 로고    scopus 로고
    • Reducing energy and delay using efficient victim caches
    • G. Memik, G. Reinman, and W. Mangione-Smith," Reducing Energy and Delay Using Efficient Victim Caches," ISLPED '03, 2003.
    • (2003) ISLPED '03
    • Memik, G.1    Reinman, G.2    Mangione-Smith, W.3
  • 13
    • 0032630130 scopus 로고    scopus 로고
    • Memory exploration for low power embedded systems
    • W- T. Shiue and C. Chakrabarti, " Memory Exploration for Low Power Embedded Systems," DAC '99, 1999.
    • (1999) DAC '99
    • Shiue, W.T.1    Chakrabarti, C.2


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