|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
ADU71
|
|
| |
BaFe83
|
O. Babaoglu and D. Ferrari, "Two-Level Replacement Decisions in Paging Stores", IF, BE Transactions on Computers, 32(12) (1983).
|
| |
BFH68
|
M.H.J. Baylis, D.G. Fletcher, and D.J. Howarth, "Paging Studies Made on the I.C.T. ATLAS Computer", Information Processing I968, IFIP Congress Booklet D (1968).
|
| |
CoVa76
|
P.J. Courtois and H. Vantilborgh, "A Decomposable Model of Program Paging Behavior", Acta Informatica, 6 pp.251-275 (1976)
|
| |
Den80
|
P.J. Denning, "Working Sets Past and Present", IEEE T#'ansactions on Software Engineering, SF#6(1) pp.64-84 (1980).
|
| |
FeLW78
|
E.B. Fernandez, T. Lang, and C. Wood, "Effect of Replacement Algorithms on a Paged Buffer Database System", IBM Journal of Research and Development, 22(2) pp.185-196 (1978).
|
 |
FrGu74
|
|
 |
GlCa97
|
|
| |
KPR92
|
A.lZ. Karlin, S.J. Phillips, and P. R.aghavan, "Markov Paging", in Proc. IEEE Symposium on the Foundations of Computer Science (FOCS) pp.208-217 (1992).
|
| |
Pha95
|
|
 |
SlTa85
|
|
| |
Spi76
|
J.R. Spirn, "Distance String Models for Program Behavior", Computer, 9 pp.14-20 (1976).
|
| |
Tor98
|
E. Torng, "A Unified Analysis of Paging and Caching", Algorithmica 20, pp.175-200 (1998).
|
 |
TuLe81
|
|
| |
WKM94
|
P.R. Wilson, S. Kakkad, and S.S. Mukherjee, "Anomalies and Adaptation in the Analysis and Development of Prefetching Policies", Journal of Systems and Software 27(2):147-153, November 1994. Technical communication.
|
| |
WoFL83
|
C. Wood, E.B. Fernandez, and T. Lang, "Minimization of Demand Paging for the LRU Stack Model of Program Behavior", Information Processing Letters, 16 pp.99-104 (1983).
|
CITED BY 35
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
D. Lee , J. Choi , J. H. Kim , S. H. Noh , S. L. Min , Y. Cho , C. S. Kim, LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies, IEEE Transactions on Computers, v.50 n.12, p.1352-1361, December 2001
|
|
|
Jong Min Kim , Donghee Lee , Sam H. Noh , Sang Lyul Min , Yookun Cho , Chong Sang Kim, An accurate and practical buffer allocation model for the buffer cache based on marginal gains, Information Processing Letters, v.85 n.2, p.93-97, 31 January 2003
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Andrea C. Arpaci-Dusseau , Remzi H. Arpaci-Dusseau , Nathan C. Burnett , Timothy E. Denehy , Thomas J. Engle , Haryadi S. Gunawi , James A. Nugent , Florentina I. Popovici, Transforming policies into mechanisms with infokernel, Proceedings of the nineteenth ACM symposium on Operating systems principles, October 19-22, 2003, Bolton Landing, NY, USA
|
|
|
|
|
|
Seon-yeong Park , Dawoon Jung , Jeong-uk Kang , Jin-soo Kim , Joonwon Lee, CFLRU: a replacement algorithm for flash memory, Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems, October 22-25, 2006, Seoul, Korea
|
|
|
|
|
|
|
|
|
Jong Min Kim , Jongmoo Choi , Jesung Kim , Sam H. Noh , Sang Lyul Min , Yookun Cho , Chong Sang Kim, A low-overhead high-performance unified buffer management scheme that exploits sequential and looping references, Proceedings of the 4th conference on Symposium on Operating System Design & Implementation, p.9-9, October 22-25, 2000, San Diego, California
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|