Paging more than one page

Theoretical Computer Science

Volumn 181, Issue 1, 1997, Pages 75-90

  Feuerstein, Esteban ^a  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; PROBLEM SOLVING;

PAGING PROBLEM;

STORAGE ALLOCATION (COMPUTER);

EID: 0031188586     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)89513-8     Document Type: Article

References (15)

1. A. Aggarwal, B. Alpern, A.K. Chandra and M. Snir, A model for hierarchical memory, in: Proc. 19th Ann. ACM Symp. on Theory of Computing (1987) 305-314.
2. A. Aggarwal and A.K. Chandra, Virtual memory algorithms, in: Proc. 20th Ann. ACM Symp. on Theory of Computing (1988) 173-185.
3. A. Aggarwal, A.K. Chandra and M. Snir, Hierarchical memory with block transfer, in: Proc. 28th Ann. Symp. on Foundations of Computer Science (1987) 204-216.
4. S. Albers, The influence of lookahead in competitive paging algorithms, in: Proc. 1st Ann. European Symp. on Algorithms, Lecture Notes in Computer Science, Vol. 726 (Springer, Berlin, 1993) 1-12.
5. L.A. Belady, A study of replacement algorithms for virtual storage computers, IBM System J. 5 (1966) 78-101.
6. A. Borodin, S. Irani, P. Raghavan and B. Schieber, Competitive paging with locality of reference, in: Proc. 23rd Ann. ACM Symp. on Theory of Computing (1991) 249-259.
7. A. Borodin, N. Linial and M. Saks, An optimal online algorithm for metrical task systems, in: Proc. 19th Ann. ACM Symp. on Theory of Computing (1987) 373-382.
8. E. Feuerstein and A. Marchetti-Spaccamela, Memory paging for connectivity and path problems in graphs, in: Proc. 4th Ann. Symp. on Algorithms and Computation, Lecture Notes in Computer Science Vol. 762 (Springer, Berlin, 1993) 416-425.
9. A. Fiat, R.M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator and N.E. Young, Competitive paging algorithms, J. Algorithms 12 (1991) 685-699.
10. A. Karlin, M. Manasse, L. Rudolph and D. Sleator, Competitive snoopy caching, Algorithmica 3 (1988) 79-119.
11. M.S. Manasse, L.A. McGeoch and D. Sleator, Competitive algorithms for server problems, J. Algorithms 11 (1990) 208-230.
12. L.A. McGeoch and D. Sleator, A strongly competitive randomized paging algorithm, Algorithmica 6 (1989) 816-825.
13. M. Nodine, M. Goodrich and J.S. Vitter, Blocking for external Graph Searching, Technical Report CS-92-44, Brown University, 1992.
14. P. Raghavan and M. Snir, Memory versus randomization in on-line algorithms, IBM Research Report RC 15622, 1990.
15. D. Sleator and R.E. Tarjan, Amortized efficiency of list update and paging algorithms, Comm. ACM 28 (1985) 202-208.