On adequate performance measures for paging

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 487-496

  Panagiotou, Konstantinos ^a   Souza, Alexander ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

LRU; Paging Problem; Performance Analysis

Indexed keywords

CACHE MEMORY; COMPUTER ARCHITECTURE; COMPUTER OPERATING SYSTEMS; VIRTUAL STORAGE;

DATA ACCESS PATTERNS; LRU; PAGING PROBLEM; PERFORMANCE ANALYSIS; PERFORMANCE RATIO;

STORAGE ALLOCATION (COMPUTER);

EID: 33748093210     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132587     Document Type: Conference Paper

References (18)

1. ALBERS, S., FAVRHOLDT, L. M., AND GIEL, O. On paging with locality of reference. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC '02) (2002), pp. 258 - 267.
2. BECCHETTI, L. Modeling locality: A probabilistic analysis of LRU and FWF. In 12th Annual European Symposium on Algorithms (ESA '04) (2004), pp. 98-109.
3. BELADY, L. A. A study of replacement algorithms for virtual storage computers. IBM Systems Journal 5 (1966), 78 - 101.
4. BORODIN, A., RAGHAVAN, P., IRANI, S., AND SCHIEBER, B. Competitive paging with locality of reference. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC '91) (1991), pp. 249-259.
5. DENNING, P. J. The working set model for program behavior. CACM 11, 5 (1968), 323 - 333.
6. FIAT, A., AND MENDEL, M. Truly online paging with locality of reference. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97) (1997), pp. 326 - 335.
7. IRANI, S., KARLIN, A. R., AND PHILLIPS, S. Strongly competitive algorithms for paging with locality of reference. Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms (SODA '92) (1992), 228 - 236.
8. KARLIN, A. R., PHILLIPS, S. J., AND RAGHAVAN, P. Markov paging. Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS '92) (1992), 208 - 217.
9. KOUTSOUPIAS, E., AND PAPADIMITRIOU, C. Beyond competitive analysis. Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS '94) (1994), 394 - 400.
10. KOUTSOUPIAS, E., AND PAPADIMITRIOU, C. On the k-server conjecture. Journal of the ACM 48, 5 (1995), 971 - 983.
11. MANASSE, M. S., MCGEOCH, L. A., AND SLEATOR, D. D. Competitive algorithms for on-line problems. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC '88) (1988), pp. 322 -333.
12. SITES, R. L., AND AGARWAL, A. Multiprocessor cache analysis using ATUM. In 15th IEEE International Symposium on Computer Architecture (1988), pp. 186 -195.
13. SLEATOR, D. D.. AND TARJAN, R. E. Amortized efficiency of list update and paging rules. Communications of the ACM 28, 2 (1985), 202 - 208.
14. SOUZA, A. Average Performance Analysis. PhD thesis, ETH Zürich, to appear.
15. SPEC - STANDARD PERFORMANCE EVALUATION CORPORATION, www.spec.org.
16. YOUNG, N. E. On-line caching as cache size varies. In Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA '91) (1991), pp. 241 -250.
17. YOUNG, N. E. Bounding the diffuse adversary. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA '98) (1998), pp. 420 -425.
18. YOUNG, N. E. On-line paging against adversarially biased random inputs. Journal of Algorithms 57, 1 (2000), 218 - 235.