메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Red: An efficient replacement algorithm based on Resident Distance for exclusive storage caches

Author keywords

Exclusive caching; Replacement algorithm; Resident distance

Indexed keywords

CLIENT CACHES; CLIENT SOFTWARE; EXCLUSIVE CACHING; REAL-LIFE SYSTEMS; RECENCY AND FREQUENCIES; REPLACEMENT ALGORITHM; RESIDENT DISTANCE; STORAGE CACHES;

EID: 77957839666     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MSST.2010.5496988     Document Type: Conference Paper
Times cited : (4)

References (20)
  • 1
    • 1542565493 scopus 로고
    • Multi-level caching in distributed file systems - or - your cache ain't nuthin' but trash
    • D. Muntz and P. Honeyman, "Multi-level caching in distributed file systems - or - your cache ain't nuthin' but trash", in Proc. of the USENIX Winter Conf., pages 305-313, 1992.
    • (1992) Proc. of the USENIX Winter Conf. , pp. 305-313
    • Muntz, D.1    Honeyman, P.2
  • 4
    • 0024983175 scopus 로고
    • Data cache management using frequency-based replacement
    • J. T. Robinson and M. V. Devarakonda, "Data cache management using frequency-based replacement", in Proc. ACM SIGMET-RICS Conf., pages 134-142, 1990.
    • (1990) Proc. ACM SIGMET-RICS Conf. , pp. 134-142
    • Robinson, J.T.1    Devarakonda, M.V.2
  • 5
    • 0014701246 scopus 로고
    • Evaluation techniques for storage hierarchies
    • R. L. Mattson, J. Gecsei, D. R. Slutz, and I. L. Traiger, "Evaluation techniques for storage hierarchies", IBM Sys. J., 9(2):78-117, 1970.
    • (1970) IBM Sys. J. , vol.9 , Issue.2 , pp. 78-117
    • Mattson, R.L.1    Gecsei, J.2    Slutz, D.R.3    Traiger, I.L.4
  • 7
    • 0027621695 scopus 로고
    • The LRU-K page replacement algorithm for database disk buffering
    • 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.
    • (1993) Proc. ACM SIGMOD Conf. , pp. 297-306
    • O'Neil, E.J.1    O'Neil, P.E.2    Weikum, G.3
  • 8
    • 0000890551 scopus 로고
    • 2Q: A low overhead high performance buffer management replacement algorithm
    • T. Johnson and D. Shasha, "2Q: A low overhead high performance buffer management replacement algorithm", in Proc. VLDB Conf., pages 297-306, 1994.
    • (1994) Proc. VLDB Conf. , pp. 297-306
    • Johnson, T.1    Shasha, D.2
  • 10
    • 0036041807 scopus 로고    scopus 로고
    • LIRS: An efficient low inter-reference recency set replacement policy to improve buffer cache performance
    • S. Jiang and X. Zhang, "LIRS: An efficient low inter-reference recency set replacement policy to improve buffer cache performance", in Proc. ACM SIGMETRICS Conf., pages 31-42, 2002.
    • (2002) Proc. ACM SIGMETRICS Conf. , pp. 31-42
    • Jiang, S.1    Zhang, X.2
  • 12
    • 2442473314 scopus 로고    scopus 로고
    • ULC: A file block placement and replacement protocol to effectively exploit hierarchical locality in multi-level buffer caches
    • S. Jiang and X. Zhang, "ULC: A file block placement and replacement protocol to effectively exploit hierarchical locality in multi-level buffer caches",in Proc. ICDCS Conf., pages 168-177, 2004.
    • (2004) Proc. ICDCS Conf. , pp. 168-177
    • Jiang, S.1    Zhang, X.2
  • 13
    • 82655174090 scopus 로고    scopus 로고
    • Karma: Know-it-all replacement for a multilevel cache
    • M. Factor, A. Schuster, and G. Yadgar, "Karma: Know-it-all replacement for a multilevel cache", in Proc. FAST Conf., pages 169-184, 2007.
    • (2007) Proc. FAST Conf. , pp. 169-184
    • Factor, M.1    Schuster, A.2    Yadgar, G.3
  • 15
    • 85030695971 scopus 로고    scopus 로고
    • On Multi-level Exclusive Caching: Offline Optimality and Why promotions are better than demotions
    • B. S. Gill, "On Multi-level Exclusive Caching: Offline Optimality and Why promotions are better than demotions", in Proc. FAST Conf., pages 49-65, 2008.
    • (2008) Proc. FAST Conf. , pp. 49-65
    • Gill, B.S.1
  • 17
    • 0035693331 scopus 로고    scopus 로고
    • LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies
    • 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. Computers, 50(12):1352-1360, 2001.
    • (2001) IEEE Trans. Computers , vol.50 , Issue.12 , pp. 1352-1360
    • Lee, D.1    Choi, J.2    Kim, J.-H.3    Noh, S.H.4    Min, S.L.5    Cho, Y.6    Kim, C.S.7
  • 19
    • 84871902852 scopus 로고    scopus 로고
    • The effect of client caching on file server workloads
    • Kevin W. Froese and Richard B. Bunt, "The effect of client caching on file server workloads", in HICSS (1), pages 150-159,1996.
    • (1996) HICSS (1) , pp. 150-159
    • Froese, K.W.1    Bunt, R.B.2
  • 20
    • 33847138202 scopus 로고    scopus 로고
    • A distributed paging RAM grid system for wide-area memory sharing
    • Rui Chu, Nong Xiao, Yongzhen Zhuang, Yunhao Liu, Xicheng Lu, "A distributed paging RAM grid system for wide-area memory sharing," in Proc. IPDPS Conf. pages 10-17, 2006.
    • (2006) Proc. IPDPS Conf. , pp. 10-17
    • Chu, R.1    Xiao, N.2    Zhuang, Y.3    Liu, Y.4    Lu, X.5


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