Application-controlled paging for a shared cache

SIAM Journal on Computing

Volumn 29, Issue 4, 2000, Pages 1290-1303

  Barve, Rakesh D ^a   Grove, Edward F ^a   Vitter, Jeffrey Scott ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER APPLICATIONS; DECISION MAKING; PROBLEM SOLVING;

APPLICATION CONTROLLED PAGING; PAGE REQUEST SEQUENCE;

BUFFER STORAGE;

EID: 0033713203     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797324278     Document Type: Article

References (8)

1. A. L. BELADY, A study of replacement algorithms for virtual storage computers, IBM Systems J., 5 (1966), pp. 78-101.
2. A. BORODIN, S. IRANI, P. RAGHAVAN, AND B. SCHIEBER, Competitive paging with locality of reference, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computation, New Orleans, LA, 1991, pp. 249-259.
3. P. CAO, E. W. FELTEN, AND K. LI, Application-controlled file caching policies, in Proceedings of the Summer USENIX Conference, Boston, MA, 1994, pp. 171-182.
4. P. CAO, E. W. FELTEN, AND K. LI, Implementation and performance of application-contolled file caching, in Proceedings of the First OSDI Symposium, Monterey, CA, 1994, pp. 165-177.
5. A. FIAT, R. M. KARP, M. LUBY, L. A. MCGEOCH, D. D. SLEATOR, AND N. E. YOUNG, On competitive algorithms for paging problems, J. Algorithms, 12 (1991), pp. 685-699.
6. A. R. KARLIN, S. J. PHILLIPS, AND P. RAGHAVAN, Markov paging, in Proceedings of the 33rd Annual IEEE Conference on Foundations of Computer Science, Pittsburgh, PA, 1992, pp. 208-217.
7. L. A. MCGEOCH AND D. D. SLEATOR, A strongly competitive randomized paging algorithm, Algorithmica, 6 (1991), pp. 816-825.
8. D. D. SLEATOR AND R. E. TARJAN, Amortized efficiency of list update and paging rules, Comm. ACM, 28 (1985), pp. 202-208.