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 条

[21] GENERALIZATION OF THE NORMALIZED LMS ALGORITHM.
Nitzberg, Ramon
IEEE Transactions on Aerospace and Electronic Systems, 1987, AES-23 (04) : 589 - 592
[22] RESTRICTED RANGE CUTTING ALGORITHM.
Ditlow, G.
Savir, J.
IBM technical disclosure bulletin, 1983, 26 (04): : 2196 - 2201
[23] FAST FOURIER TRANSFORM ALGORITHM.
Cabion, P.J.
Transactions of the South African Institute of Electrical Engineers, 1980, 71 (pt 5): : 112 - 116
[24] ON ONE NONSTATISTICAL IDENTIFICATION ALGORITHM.
Bakan, G.M.
Kibernetika i Vychislitel'naya Tekhnika, 1985, (67): : 64 - 74
[25] RELAXATION-BASED ALGORITHM.
Braswell, Hank T.
Mitchell, Jerrel R.
1978,
[26] EFFICIENT STRING SEARCHING ALGORITHM.
Semba, Ichiro
Journal of Information Processing, 1985, 8 (02) : 101 - 109
[27] ADAPTIVE WAVEFORM RELAXATION ALGORITHM.
Odeh, F.M.
Ruehli, A.E.
IBM technical disclosure bulletin, 1984, 27 (1 B): : 708 - 709
[28] QUICKSHUNT - A DISTRIBUTIVE SORTING ALGORITHM.
McCulloch, C.M.
Computer Journal, 1982, 25 (01): : 102 - 104
[29] DIAlECTICs OF THE AlGORITHM. FOR A CRITICAl THEORy
Carli, Massimiliano
Lubrano, Vittorio
SGUARDO-RIVISTA DI FILOSOFIA, 2022, (34): : 79 - 98
[30] CACHE LINE REPLACEMENT ALGORITHM.
Anon
1890, (29):

← 1 2 3 4 5 →