Strongly competitive algorithms for paging with locality of reference

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 228-236

  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

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

COMPETITIVE ALGORITHMS; CONSTANT FACTORS; GRAPH MODEL; LOCALITY OF REFERENCE; OPTIMAL ALGORITHM; PAGING ALGORITHMS; PARTIAL INFORMATION;

DIRECTED GRAPHS;

EID: 85030068774     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78-101, 1966.
2. A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive Paging with Locality of Reference. In Proc. 23rd Annual ACM Symposium on Theory of Computing, pages 249-259, 1991.
3. P.J. Denning. Working sets past and present. IEEE Trans. Software Engg., SE-6:64-84, 1980.
4. 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, 1991.
5. P.A. Franaszek and T.J. Wagner. Some distribution-free aspects of paging performance. Journal of the ACM, 21:31-39, 1974.
6. A. R. Karlin, M. S. Manasse, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):70-119, 1988.
7. T. Kilburn, D.B.G. Edwards, M.J. Lanigan, and F.H. Sumner. One-level storage system. IRE Trans. Elect. Computers, 37:223-235, 1962.
8. M.S. Manasse, L.A. McGeoch, and D.D. Sleator. Competitive algorithms for on-line problems. Journal of Algorithms, 11:208-230, 1990.
9. G.S. Shedler and C. Tung. Locality in page reference strings. SIAM Journal on Computing, 1:218-241, 1972.
10. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, February 1985.
11. J.R. Spirn. Program Behavior: Models and Measurements. Elsevier Computer Science Library. Elsevier, Amsterdam, 1977.
12. D. Cheriton and K. Harty. Application-controlled physical memory using external page-cache management. Technical Report draft, Department of Computer Science, Stanford University, 1991.
13. D. McNamee and K. Armstrong. Extending the Mach external pager interface to accommodate user-level page replacement policies. Technical Report 90-0905, Department of Computer Science and Engineering, University of Washington, 1990.