SDMRU - A PAGING ALGORITHM.

被引：0
|
作者：
Arora, R.
Subramanian, R.K.
机构：
来源：
Australian Computer Journal | 1979年 / 11卷 / 04期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The least recently used paging algorithm is popularly known, yet has the disadvantage of producing continuous page faults when a cyclic reference of m plus 1 or more pages is made with m pages in the main memory. A semi-dynamic algorithm, SDMRU, is proposed which avoids such continuous page faults over relatively high ranges of memory size when tested with constructed programs of characteristic and representative behavior. The implementation is simple. A suggestion for modifying it into a demand prepaging algorithm is also made. The suitability of SDMRU in a multiprogramming environment is also discussed.
引用
收藏
页码：122 / 126
相关论文
共 50 条
  • [1] PROCESS INTERRUPT ALGORITHM.
    Nagel, D.M.
    1600, (15):
  • [2] DEADLOCK DETECT ALGORITHM.
    Dayan, R.A.
    Williams, D.D.
    IBM technical disclosure bulletin, 1983, 26 (04): : 1858 - 1860
  • [3] DATA STRUCTURING ALGORITHM.
    Harper, H.L.
    IBM technical disclosure bulletin, 1983, 26 (06): : 2715 - 2718
  • [4] EFFICIENT ROUTING ALGORITHM.
    Shi, Kai-jian
    Zhu Hong-e
    CAD Computer Aided Design, 1987, 19 (07): : 375 - 379
  • [5] EXCLUSIVE OR REDUCTION ALGORITHM.
    Anon
    1600, (29):
  • [6] UNIFORM HASHING ALGORITHM.
    Arnold, R.F.
    Bass, W.E.
    Hartung, M.H.
    Snow, F.D.
    Stephens III, R.D.
    1600, (16):
  • [7] DOMINATORS AND THE CUTTING ALGORITHM.
    Anon
    IBM technical disclosure bulletin, 1985, 28 (03): : 1201 - 1203
  • [8] ADAPTIVE ESTIMATION ALGORITHM.
    Sastri, T.
    IIE Transactions (Institute of Industrial Engineers), 1988, 20 (02): : 176 - 185
  • [9] ARC CLIPPING ALGORITHM.
    Anon
    IBM technical disclosure bulletin, 1986, 28 (10): : 4570 - 4574
  • [10] UTILITY CONTROL ALGORITHM.
    Anon
    IBM technical disclosure bulletin, 1986, 28 (08): : 3657 - 3660
12345