Strongly competitive algorithms for paging with locality of reference

SIAM Journal on Computing

Volumn 25, Issue 3, 1996, Pages 477-497

  Irani, Sandy ^a   Karlin, Anna R ^b   Phillips, Steven ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HEWLETT PACKARD COMPANY   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

Analysis of algorithms; Competitive analysis; Locality of reference; Online algorithms; Paging

Indexed keywords

EID: 0000139076     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539792236353     Document Type: Article

References (13)

1. L. A. 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, J. Comput. System Sci., 50 (1995), pp. 244-258.
3. D. CHERITON AND K. HARTY, Application-controlled physical memory using external page-cache management, Technical report draft, Department of Computer Science, Stanford University, Stanford, CA, 1991.
4. P. J. DENNING, Working sets past and present, IEEE Trans. Software Engrg., SE-6 (1980), pp. 64-84.
5. A. FIAT, R. KARP, M. LUBY, L. McGEOCH, D. SLEATOR, AND N. YOUNG, On competitive algorithms for paging problems, J. Algorithms, 12 (1991), pp. 685-699.
6. P. A. FRANASZEK AND T. J. WAGNER, Some distribution-free aspects of paging performance, J. Assoc. Comput. Mach., 21 (1974), pp. 31-39.
7. A. R. KARLIN, M. S. MANASSE, L. RUDOLPH, AND D. D. SLEATOR, Competitive snoopy caching, Algorithmica, 3 (1988), pp. 70-119.
8. T. KILBURN, D. B. G. EDWARDS, M. J. LANIGAN, AND F. H. SUMNER, One-level storage system, IRE Trans. Elect. Computers, 37 (1962), pp. 223-235.
9. M. S. MANASSE, L. A. MCGEOCH, AND D. D. SLEATOR, Competitive algorithms for on-line problems, J. Algorithms, 11 (1990), pp. 208-230.
10. 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, Seattle, WA, 1990.
11. G. S. SHEDLER AND C. TUNG, Locality in page reference strings, SIAM J. Comput., 1 (1972), pp. 218-241.
12. D. D. SLEATOR AND R. E. TARJAN, Amortized efficiency of list update and paging rules, Comm. Assoc. Comput. Mach., 28 (1985), pp. 202-208.
13. J. R. SPIRN, Program Behavior: Models and Measurements, Elsevier Computer Science Library. Elsevier, Amsterdam, 1977.