Markov paging

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1992-October, Issue , 1992, Pages 208-217

  Karlin, Anna R ^a   Phillips, Steven J ^b   Raghavan, Prabhakar ^c  

^a DEC Systems Reseaxch Center ^*  (United States)

^b STANFORD UNIVERSITY   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; PROBABILITY DISTRIBUTIONS;

FAULT RATES; MARKOV DECISION PROCESSES; PAGING ALGORITHMS; PAGING STRATEGIES; PERFORMANCE GUARANTEES; QUANTITY OF INTEREST;

MARKOV PROCESSES;

EID: 84943296701     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267771     Document Type: Conference Paper

References (17)

1. S. Ben-David, A. Borodin, R.M. Karp, G. Tar-dos, and A. Wigderson. On the power of randomization in on-line algorithms. In Proc. 22nd Annual ACM Symposium on Theory of Computing, pages 379-388, 1990.
2. A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive paging with locality of reference. In Twenty-Third Annual ACM Symposium on Theory of Computing, pages 249-259, 1991.
3. D. Cheriton and K. Harty. Application-controlled physical memory using external page-cache management. Technical report, Department of Computer Science, Stanford University, 1991.
4. P.J. Denning. Working Sets Past and Present. In IEEE Trans. Software Eng. SE-6:64-84, 1980.
5. C. Derman. Finite State Markov Decision Processes. Academic Press, New York, 1970.
6. A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young. On competitive algorithms for paging problems. To appear in Journal of Algorithms, 1990.
7. P.A. Franaszek and T.J. Wagner. Some distribution-free aspects of paging performance. Journal of the ACM, 21:31-39, 1974.
8. S.S. Irani, A.R. Karlin, and S.J. Phillips. Further results on paging with locality of reference. In Third Annual ACM-SIAM Symposium on Discrete Algorithms, 1992.
9. A. R. Karlin, M. S. Manasse, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Al-gorithmica, 3(1):70-119, 1988.
10. R.M. Karp. A characterization of the minimum cycle mean in a digraph. Discrete Mathematics, 23:309-311, 1978.
11. P.A.W. Lewis and G.S. Shedler. Empirically derived models for sequences of page exceptions. IBM J. Res. and Develop., 17:86-100, 1973.
12. D. McNamee and K. Armstrong. Extending the mach external pager interface to accommodate user-level page replacement policies. Technical Report 90-09-05, Department of Computer Science and Engineering, University of Washington, 1990.
13. P. Raghavan and M. Snir. Memory versus randomization in on-line algorithms. In 16th International Colloquium on Automata, Languages, and Programming, volume 372 of Lecture Notes in Computer Science, pages 687-703. Springer-Verlag, July 1989. Revised version available as IBM Research Report RC15840, June 1990.
14. G.S. Shedler and C. Tung. Locality in page reference strings. SIAM Journal on Computing, 1:218-241, 1972.
15. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, February 1985.
16. J.R. Spirn Program Behavior: Models and Measurements Elsevier Computer Science Library. Elsevier, Amsterdam. 1977.
17. J.S. Vitter and P. Krishnan. Optimal Prefetching via Data Compression In Thirty-Second Annual IEEE Symposium on Foundations of Computer Science, 1991.