메뉴 건너뛰기




Volumn 63, Issue 2, 2006, Pages 99-130

A page fault equation for modeling the effect of memory size

Author keywords

Capacity planning; Database buffer management; Invariant; Memory allocation; Memory requirement; Power control; Processor cache design

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SIMULATION; DATABASE SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; POWER CONTROL; REAL TIME SYSTEMS; STORAGE ALLOCATION (COMPUTER);

EID: 28044455034     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2005.01.007     Document Type: Article
Times cited : (20)

References (48)
  • 3
    • 0003003638 scopus 로고
    • A study of replacement algorithms for virtual storage computers
    • L.A. Belady A study of replacement algorithms for virtual storage computers IBM Syst. J. 5 1966 78 101
    • (1966) IBM Syst. J. , vol.5 , pp. 78-101
    • Belady, L.A.1
  • 9
    • 0027545019 scopus 로고
    • Managing locality sets: The model and fixed-size buffers
    • A. Choi, and M. Ruschitzka Managing locality sets: the model and fixed-size buffers IEEE Trans. Comput. 42 2 1993 190 204
    • (1993) IEEE Trans. Comput. , vol.42 , Issue.2 , pp. 190-204
    • Choi, A.1    Ruschitzka, M.2
  • 10
    • 0017100218 scopus 로고
    • A decomposable model of program paging behavior
    • P.J. Courtois, and H. Vantilborgh A decomposable model of program paging behavior Acta Inform. 6 1976 251 275
    • (1976) Acta Inform. , vol.6 , pp. 251-275
    • Courtois, P.J.1    Vantilborgh, H.2
  • 11
    • 79955715200 scopus 로고
    • The working set model for program behavior
    • P.J. Denning The working set model for program behavior Commun. ACM 11 5 1968 323 333
    • (1968) Commun. ACM , vol.11 , Issue.5 , pp. 323-333
    • Denning, P.J.1
  • 13
    • 0025557521 scopus 로고
    • An approximate analysis of the LRU and FIFO buffer replacement schemes
    • Boulder, CO, May
    • A. Dan, and D. Towsley An approximate analysis of the LRU and FIFO buffer replacement schemes Proceedings of the ACM SIGMETRICS Boulder, CO, May 1990 143 152
    • (1990) Proceedings of the ACM SIGMETRICS , pp. 143-152
    • Dan, A.1    Towsley, D.2
  • 14
    • 0009826818 scopus 로고
    • Characterization of database access pattern for analytic prediction of buffer hit probability
    • A. Dan, P.S. Yu, and J.-Y. Chung Characterization of database access pattern for analytic prediction of buffer hit probability VLDB J. 4 1 1995 127 154
    • (1995) VLDB J. , vol.4 , Issue.1 , pp. 127-154
    • Dan, A.1    Yu, P.S.2    Chung, J.-Y.3
  • 15
    • 0015960103 scopus 로고
    • Some distribution-free aspects of paging algorithm performance
    • P.A. Franaszek, and T.J. Wagner Some distribution-free aspects of paging algorithm performance J. Assoc. Comput. Mach. 21 1 1974 31 39
    • (1974) J. Assoc. Comput. Mach. , vol.21 , Issue.1 , pp. 31-39
    • Franaszek, P.A.1    Wagner, T.J.2
  • 16
    • 0031166599 scopus 로고    scopus 로고
    • Adaptive page replacement based on memory reference behavior
    • Seattle, WA, June
    • G. Glass, and P. Cao Adaptive page replacement based on memory reference behavior Proceedings of the ACM SIGMETRICS Seattle, WA, June 1997 115 126
    • (1997) Proceedings of the ACM SIGMETRICS , pp. 115-126
    • Glass, G.1    Cao, P.2
  • 19
    • 0000139076 scopus 로고    scopus 로고
    • Strongly competitive algorithms for paging with locality of reference
    • S. Irani, A.R. Karlin, and S. Phillips Strongly competitive algorithms for paging with locality of reference SIAM J. Comput. 25 3 1996 477 497
    • (1996) SIAM J. Comput. , vol.25 , Issue.3 , pp. 477-497
    • Irani, S.1    Karlin, A.R.2    Phillips, S.3
  • 21
    • 0000890551 scopus 로고
    • 2Q: A low overhead high performance buffer management replacement algorithm
    • Santiago, Chile, September
    • T. Johnson, and D. Shasha 2Q: a low overhead high performance buffer management replacement algorithm Proceedings of the VLDB Santiago, Chile, September 1994 439 450
    • (1994) Proceedings of the VLDB , pp. 439-450
    • Johnson, T.1    Shasha, D.2
  • 22
    • 0036041807 scopus 로고    scopus 로고
    • LIRS: An efficient low inter-reference recency set replacement policy to improve buffer cache performance
    • Marina Del Rey, CA, June
    • S. Jiang, and X. Zhang LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance Proceedings of the ACM SIGMETRICS Marina Del Rey, CA, June 2002 31 42
    • (2002) Proceedings of the ACM SIGMETRICS , pp. 31-42
    • Jiang, S.1    Zhang, X.2
  • 23
    • 0034442476 scopus 로고    scopus 로고
    • An analytical model of the working-set sizes in decision-support systems
    • Santa Clara, CA, June
    • M. Karlsson, F. Dahlgren, and P. Stenstrom An analytical model of the working-set sizes in decision-support systems Proceedings of the SIGMETRICS Santa Clara, CA, June 2000 275 285
    • (2000) Proceedings of the SIGMETRICS , pp. 275-285
    • Karlsson, M.1    Dahlgren, F.2    Stenstrom, P.3
  • 28
    • 84991005150 scopus 로고
    • Analysis of the generalized clock buffer replacement scheme for database transaction processing
    • Newport, RI, June
    • V.F. Nicola, A. Dan, and D.M. Dias Analysis of the generalized clock buffer replacement scheme for database transaction processing Proceedings of the SIGMETRICS Newport, RI, June 1992 35 46
    • (1992) Proceedings of the SIGMETRICS , pp. 35-46
    • Nicola, V.F.1    Dan, A.2    Dias, D.M.3
  • 29
    • 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. Assoc. Comput. Mach. 46 1 1999 92 112
    • (1999) J. Assoc. Comput. Mach. , vol.46 , Issue.1 , pp. 92-112
    • O'Neil, E.J.1    O'Neil, P.E.2    Weikum, G.3
  • 30
    • 28044470425 scopus 로고    scopus 로고
    • Method and system for allocating cache memory for a network database service, Patent Number US 6,493,810 B1
    • J.F. Pang, M. Raghuraman, Y.C. Tay, Method and system for allocating cache memory for a network database service, Patent Number US 6,493,810 B1 (2002).
    • (2002)
    • Pang, J.F.1    Raghuraman, M.2    Tay, Y.C.3
  • 31
    • 0025537206 scopus 로고
    • Data cache management using frequency-based replacement
    • Boulder, CO, May
    • J.T. Robinson, and M.V. Devarakonda Data cache management using frequency-based replacement Proceedings of the ACM SIGMETRICS Boulder, CO, May 1990 134 142
    • (1990) Proceedings of the ACM SIGMETRICS , pp. 134-142
    • Robinson, J.T.1    Devarakonda, M.V.2
  • 33
    • 1642601784 scopus 로고    scopus 로고
    • Replacement policies for a proxy cache
    • L. Rizzo, and L. Vicisano Replacement policies for a proxy cache IEEE/ACM Trans. Network. 8 2 2000 158 170
    • (2000) IEEE/ACM Trans. Network. , vol.8 , Issue.2 , pp. 158-170
    • Rizzo, L.1    Vicisano, L.2
  • 37
    • 0017017218 scopus 로고
    • Distance string models for program behavior
    • J.R. Spirn Distance string models for program behavior Computer 9 11 1976 14 20
    • (1976) Computer , vol.9 , Issue.11 , pp. 14-20
    • Spirn, J.R.1
  • 38
    • 0004601819 scopus 로고
    • Locality in page reference strings
    • G.S. Shedler, and C. Tung Locality in page reference strings SIAM J. Comput. 1 3 1972 218 241
    • (1972) SIAM J. Comput. , vol.1 , Issue.3 , pp. 218-241
    • Shedler, G.S.1    Tung, C.2
  • 39
    • 0022012946 scopus 로고
    • Amortized efficiency of list update and paging rules
    • D.D. Sleator, and R.E. Tarjan Amortized efficiency of list update and paging rules Commun. ACM 28 2 1985 202 208
    • (1985) Commun. ACM , vol.28 , Issue.2 , pp. 202-208
    • Sleator, D.D.1    Tarjan, R.E.2
  • 40
    • 0000094273 scopus 로고    scopus 로고
    • A unified analysis of paging and caching
    • E. Torng A unified analysis of paging and caching Algorithmica 20 2 1998 175 200
    • (1998) Algorithmica , vol.20 , Issue.2 , pp. 175-200
    • Torng, E.1
  • 42
    • 0031168471 scopus 로고    scopus 로고
    • Database buffer size investigation for OLTP workloads
    • Tucson, AZ, May
    • T.F. Tsuei, A.N. Packer, and K.T. Ko Database buffer size investigation for OLTP workloads Proceedings of the ACM SIGMOD Tucson, AZ, May 1997 112 122
    • (1997) Proceedings of the ACM SIGMOD , pp. 112-122
    • Tsuei, T.F.1    Packer, A.N.2    Ko, K.T.3
  • 43
    • 0026881152 scopus 로고
    • Improving disk cache hit-ratios through cache partitioning
    • D. Thiébaut, H.S. Stone, and J.L. Wolf Improving disk cache hit-ratios through cache partitioning IEEE Trans. Comput. 41 6 1992 665 676
    • (1992) IEEE Trans. Comput. , vol.41 , Issue.6 , pp. 665-676
    • Thiébaut, D.1    Stone, H.S.2    Wolf, J.L.3
  • 45
    • 0003202408 scopus 로고    scopus 로고
    • Lightweight directory access protocol (v3)
    • IETF, December
    • M. Wahl, T. Howes, S. Kille, Lightweight directory access protocol (v3). IETF, December 1997. Request for Comments RFC 2251.
    • (1997) Request for Comments RFC , vol.2251
    • Wahl, M.1    Howes, T.2    Kille, S.3


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