메뉴 건너뛰기




Volumn , Issue , 2009, Pages 49-58

Instruction-based reuse-distance prediction for effective cache management

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS PATTERNS; CACHE ACCESS; CACHE BLOCKS; CACHE MANAGEMENT; CACHE MANAGEMENT TECHNIQUES; DATA REUSE; L2 CACHE; PREDICTION SCHEMES; REUSE DISTANCE; RUNTIMES; STATE OF THE ART; TEMPORAL CHARACTERISTICS; TEMPORAL LOCALITY;

EID: 71949083812     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSAMOS.2009.5289241     Document Type: Conference Paper
Times cited : (23)

References (33)
  • 1
    • 0003003638 scopus 로고
    • A study of replacement algorithms for a virtualstorage computer
    • L. A. Belady. A study of replacement algorithms for a virtualstorage computer. IBM Systems Journal, 1966.
    • (1966) IBM Systems Journal
    • Belady, L.A.1
  • 8
    • 71949086095 scopus 로고    scopus 로고
    • http://users.ece.utexas.edu/~qk/dip/
  • 11
  • 14
    • 71949090538 scopus 로고    scopus 로고
    • M. Karlsson and E. Hagersten. Timestamp-Based Selective Cache Allocation. In the Workshop on Memory Performance Issues, 2001.
    • M. Karlsson and E. Hagersten. Timestamp-Based Selective Cache Allocation. In the Workshop on Memory Performance Issues, 2001.
  • 18
    • 23544472438 scopus 로고    scopus 로고
    • University of Michigan Technical Report (CSE-TR-447-02)
    • W. F. Lin and S. K. Reinhardt. Predicting last-touch references under optimal replacement. University of Michigan Technical Report (CSE-TR-447-02), 2002.
    • (2002)
    • Lin, W.F.1    Reinhardt, S.K.2
  • 23
    • 35348920021 scopus 로고    scopus 로고
    • M. K. Qureshi, A. Jaleel, Y. N. Patt, S. C. S. Jr., and J. Emer. Adaptive insertion policies for high-performance caching. Proc. of the International Sympocium on Computer Architecture (ISCA), 2007.
    • M. K. Qureshi, A. Jaleel, Y. N. Patt, S. C. S. Jr., and J. Emer. Adaptive insertion policies for high-performance caching. Proc. of the International Sympocium on Computer Architecture (ISCA), 2007.
  • 28
    • 8344233359 scopus 로고    scopus 로고
    • Inter-Reference Gap Distribution Replacement: An Improved Replacement Algorithm for Set- Associative Caches
    • M. Takagi and K. Hiraki. Inter-Reference Gap Distribution Replacement: an Improved Replacement Algorithm for Set- Associative Caches. Proc. of the International Conference on Supercomputing (ICS), 2004.
    • (2004) Proc. of the International Conference on Supercomputing (ICS)
    • Takagi, M.1    Hiraki, K.2
  • 29
    • 0033075110 scopus 로고    scopus 로고
    • An algorithm for optimally exploiting spatial and temporal locality in upper memory levels
    • O. Temam. An algorithm for optimally exploiting spatial and temporal locality in upper memory levels. IEEE Transactions on Computers, 1999.
    • (1999) IEEE Transactions on Computers
    • Temam, O.1


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