메뉴 건너뛰기




Volumn 33, Issue 1, 2005, Pages 157-168

The performance impact of kernel prefetching on buffer cache replacement algorithms

Author keywords

Buffer caching; Prefetching; Replacement algorithms

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS; SYSTEMS ANALYSIS;

EID: 33244494252     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/1071690.1064231     Document Type: Conference Paper
Times cited : (37)

References (41)
  • 1
    • 0038379380 scopus 로고    scopus 로고
    • Integrated prefetching and caching in single and parallel disk systems
    • June
    • S. Albers and M. Bttner. Integrated prefetching and caching in single and parallel disk systems. In Proc. 15th ACM SPAA, June 2003.
    • (2003) Proc. 15th ACM SPAA
    • Albers, S.1    Bttner, M.2
  • 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
  • 5
    • 0012609370 scopus 로고    scopus 로고
    • Computer-based I/O prefetching for out-of-core applications
    • A. D. Brown, T. C. Mowry, and O. Krieger. Computer-based I/O prefetching for out-of-core applications. ACM TOCS, 19(2):111-170, 2001.
    • (2001) ACM TOCS , vol.19 , Issue.2 , pp. 111-170
    • Brown, A.D.1    Mowry, T.C.2    Krieger, O.3
  • 6
    • 33745918479 scopus 로고    scopus 로고
    • The performance impact of kernel prefetching on buffer cache replacement algorithms
    • Purdue Univeristy, March
    • A. R. Butt, C. Gniady, and Y. Hu. The performance impact of kernel prefetching on buffer cache replacement algorithms. In Technical Report TR-ECE-05-04, Purdue Univeristy, March 2005.
    • (2005) Technical Report , vol.TR-ECE-05-04
    • Butt, A.R.1    Gniady, C.2    Hu, Y.3
  • 7
    • 84921260656 scopus 로고
    • A study of integrated prefetching and caching strategies
    • May
    • P. Cao, E. Felten, and K. Li. A study of integrated prefetching and caching strategies. In Proc. ACM BIOMETRICS, May 1995.
    • (1995) Proc. ACM BIOMETRICS
    • Cao, P.1    Felten, E.2    Li, K.3
  • 8
    • 0030288189 scopus 로고    scopus 로고
    • Implementation and performance of integrated application-controlled file caching, prefetching, and disk scheduling
    • P. Cao, E. W. Felten, A. R. Karlin, and K. Li. Implementation and performance of integrated application-controlled file caching, prefetching, and disk scheduling. ACM TOCS, 14(4):311-343, 1996.
    • (1996) ACM TOCS , vol.14 , Issue.4 , pp. 311-343
    • Cao, P.1    Felten, E.W.2    Karlin, A.R.3    Li, K.4
  • 9
    • 84978368551 scopus 로고
    • WSCLOCK - A simple and effective algorithm for virtual memory management
    • Dec.
    • R. W. Carr and J. L. Hennessy. WSCLOCK - a simple and effective algorithm for virtual memory management. In Proc. ACM SOSP-08, Dec. 1981.
    • (1981) Proc. ACM SOSP-08
    • Carr, R.W.1    Hennessy, J.L.2
  • 10
    • 0037567883 scopus 로고    scopus 로고
    • Automatic I/O hint generation through speculative execution
    • Feb.
    • F. W. Chang and G. A. Gibson. Automatic I/O hint generation through speculative execution. In Proc. 3rd USENIX OSDI, Feb. 1999.
    • (1999) Proc. 3rd USENIX OSDI
    • Chang, F.W.1    Gibson, G.A.2
  • 11
    • 85084163725 scopus 로고    scopus 로고
    • An implementation study of a detection-based adaptive block replacement scheme
    • June
    • J. Choi, S. H. Noh, S. L. Min, and Y. Cho. An Implementation Study of a Detection-Based Adaptive Block Replacement Scheme. In Proc. USENIX ATC, June 1999.
    • (1999) Proc. USENIX ATC
    • Choi, J.1    Noh, S.H.2    Min, S.L.3    Cho, Y.4
  • 12
    • 33244468108 scopus 로고    scopus 로고
    • Towards application/file-level characterization of block references: A case for fine-grained buffer management
    • June
    • J. Choi, S. H. Noh, S. L. Min, and Y. Cho. Towards application/file-level characterization of block references: a case for fine-grained buffer management. In Proc. ACM SIGMETRICS, June 2000.
    • (2000) Proc. ACM SIGMETRICS
    • Choi, J.1    Noh, S.H.2    Min, S.L.3    Cho, Y.4
  • 13
    • 0002884879 scopus 로고    scopus 로고
    • Adaptive page replacement based on memory reference behavior
    • June
    • G. Glass and P. Cao. Adaptive page replacement based on memory reference behavior. In Proc. ACM SIGMETRICS, June 1997.
    • (1997) Proc. ACM SIGMETRICS
    • Glass, G.1    Cao, P.2
  • 14
    • 33645603847 scopus 로고    scopus 로고
    • Program counter based pattern classification in buffer caching
    • Dec.
    • C. Gniady, A. R. Butt, and Y. C. Hu. Program counter based pattern classification in buffer caching. In Proc. 6th USENIX OSDI, Dec. 2004.
    • (2004) Proc. 6th USENIX OSDI
    • Gniady, C.1    Butt, A.R.2    Hu, Y.C.3
  • 16
    • 0003496848 scopus 로고
    • Performance measurements of automatic prefetching
    • Sep.
    • J. Griffioen and R. Appleton. Performance measurements of automatic prefetching. In Proc. 8th ICPDCS, Sep. 1995.
    • (1995) Proc. 8th ICPDCS
    • Griffioen, J.1    Appleton, R.2
  • 17
    • 83755216860 scopus 로고    scopus 로고
    • CLOCK-Pro: An effective improvement of the CLOCK replacement
    • Apr.
    • S. Jiang, F. Chen, and X. Zhang. CLOCK-Pro: An effective improvement of the CLOCK replacement. In Proc. USENIX ATC, Apr. 2005.
    • (2005) Proc. USENIX ATC
    • Jiang, S.1    Chen, F.2    Zhang, X.3
  • 18
    • 1942539631 scopus 로고    scopus 로고
    • LIRS: An efficient low inter-reference recency set replacement policy to improve buffer cache performance
    • June
    • S. Jiang and X. Zhang. LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance. In Proc. ACM SIGMETRICS, June 2002.
    • (2002) Proc. ACM SIGMETRICS
    • Jiang, S.1    Zhang, X.2
  • 19
    • 0000890551 scopus 로고
    • 2Q: A low overhead high performance buffer management replacement algorithm
    • Jan.
    • T. Johnson and D. Shasha. 2Q: a low overhead high performance buffer management replacement algorithm. In Proc. 20th VLDB, Jan. 1994.
    • (1994) Proc. 20th VLDB
    • Johnson, T.1    Shasha, D.2
  • 20
    • 0034833591 scopus 로고    scopus 로고
    • Optimal prefetching and caching for parallel I/O sytems
    • July
    • M. Kallahalla and P. J. Varman. Optimal prefetching and caching for parallel I/O sytems. In Proc. 13th ACM SPAA, July 2001.
    • (2001) Proc. 13th ACM SPAA
    • Kallahalla, M.1    Varman, P.J.2
  • 21
    • 33244497809 scopus 로고    scopus 로고
    • A low-overhead, high-performance unified buffer management scheme that exploits sequential and looping references
    • Oct.
    • J. M. Kim, J. Choi, J. Kim, S. H. Noh, S. L. Min, Y. Cho, and C. S. Kim. A Low-Overhead, High-Performance Unified Buffer Management Scheme that Exploits Sequential and Looping References. In Proc. 4th USENIX OSDI, Oct. 2000.
    • (2000) Proc. 4th USENIX OSDI
    • Kim, J.M.1    Choi, J.2    Kim, J.3    Noh, S.H.4    Min, S.L.5    Cho, Y.6    Kim, C.S.7
  • 22
    • 0033701442 scopus 로고    scopus 로고
    • Near-optimal parallel prefetching and caching
    • T. Kimbrel and A. R. Karlin. Near-optimal parallel prefetching and caching. SIAM J. Comput., 29(4):1051-1082, 2000.
    • (2000) SIAM J. Comput. , vol.29 , Issue.4 , pp. 1051-1082
    • Kimbrel, T.1    Karlin, A.R.2
  • 24
    • 0009862428 scopus 로고    scopus 로고
    • On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies
    • May
    • D. Lee, J. Choi, J.-H. Kim, S. H. Noh, S. L. Min, Y. Cho, and C. S. Kim. On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies. In Proc. ACM SIGMETRICS, May 1999.
    • (1999) Proc. ACM SIGMETRICS
    • 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
  • 25
    • 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 Transactions on Computers, 50(12):1352-1360, 2001.
    • (2001) IEEE Transactions on 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
  • 27
    • 85048415470 scopus 로고    scopus 로고
    • ARC: A self-tuning, low overhead replacement cache
    • Mar.
    • N. Megiddo and D. S. Modha. ARC: A Self-tuning, Low Overhead Replacement Cache. In Proc. 2nd USENIX FAST, Mar. 2003.
    • (2003) Proc. 2nd USENIX FAST
    • Megiddo, N.1    Modha, D.S.2
  • 28
    • 85088074507 scopus 로고    scopus 로고
    • Automatic compiler-inserted i/o prefetching for out-of-core applications
    • Oct.
    • T. C. Mowry, A. K. Demke, and O. Krieger. Automatic compiler-inserted i/o prefetching for out-of-core applications. In Proc. 2nd USENIX OSDI, Oct. 1996.
    • (1996) Proc. 2nd USENIX OSDI
    • Mowry, T.C.1    Demke, A.K.2    Krieger, O.3
  • 31
    • 0007836677 scopus 로고    scopus 로고
    • An optimality proof of the LRU-K page replacement algorithm
    • E. J. O'Neil, P. E. O'Neil, and G. Weikum. An optimality proof of the LRU-K page replacement algorithm. J. ACM, 46(1):92-112, 1999.
    • (1999) J. ACM , vol.46 , Issue.1 , pp. 92-112
    • O'Neil, E.J.1    O'Neil, P.E.2    Weikum, G.3
  • 33
    • 0025537206 scopus 로고
    • Data cache management using frequency-based replacement
    • May
    • J. T. Robinson and M. V. Devarakonda. Data cache management using frequency-based replacement. In Proc. ACM SIGMETRICS, May 1990.
    • (1990) Proc. ACM SIGMETRICS
    • Robinson, J.T.1    Devarakonda, M.V.2
  • 36
    • 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, 48(2): 150-158, 1999.
    • (1999) IEEE Transactions on Computers , vol.48 , Issue.2 , pp. 150-158
    • Temam, O.1
  • 38
    • 0034830157 scopus 로고    scopus 로고
    • Arima time series modeling and forecasting for adaptive i/o prefetching
    • June
    • N. Tran and D. A. Reed. Arima time series modeling and forecasting for adaptive i/o prefetching. In Proc. 15th ICS, June 2001.
    • (2001) Proc. 15th ICS
    • Tran, N.1    Reed, D.A.2
  • 39
    • 84858548707 scopus 로고    scopus 로고
    • Transaction Processing Performance Council. http://www.tpc.org/, 2005.
    • (2005)
  • 40
    • 84977882688 scopus 로고    scopus 로고
    • A cost-benefit scheme for high performance predictive prefetching
    • Nov.
    • V. Vellanki and A. L. Chervenak. A cost-benefit scheme for high performance predictive prefetching. In Proc. ACM/IEEE SC'99, Nov. 1999.
    • (1999) Proc. ACM/IEEE SC'99
    • Vellanki, V.1    Chervenak, A.L.2
  • 41
    • 84893513203 scopus 로고    scopus 로고
    • The multi-queu replacement algorithm for second-level buffer caches
    • June
    • Y. Zhou, P. M. Chen, , and K. Li. The Multi-Queu Replacement Algorithm for Second-Level Buffer Caches. In Proc. USENIX ATC, June 2001.
    • (2001) Proc. USENIX ATC
    • Zhou, Y.1    Chen, P.M.2    Li, K.3


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