On paging with locality of reference

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 258-267

  Albers, Susanne ^a   Favrholdt, Lene M ^a   Giel, Oliver ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; GRAPHIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; STORAGE ALLOCATION (COMPUTER); THEOREM PROVING;

PAGE FAULT RATE; PAGING ALGORITHM; PAGING PROBLEM;

ALGORITHMS;

EID: 0036036760     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509948.509949     Document Type: Conference Paper

References (18)

1. A study of replacement algorithms for virtual storage computers
2. Competitive paging with locality of reference
3. LRU is better than FIFO
4. The working set model of program behavior
5. Working sets past and present
6. Randomized and multipointer paging with locality of reference
7. Truly online paging with locality of reference
8. Some distribution-free aspects of paging algorithm performance
9. Strongly competitive algorithms for paging with locality of reference
10. Markov paging
11. Beyond competitive analysis
12. Amortized efficiency of list update and paging rules
13. A unified analysis of paging and caching
14. The k-server dual and loose competitiveness for paging