Uniform multipaging reduces to paging

Information Processing Letters

Volumn 67, Issue 1, 1998, Pages 9-12

  Liberatore, Vincenzo ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Competitive analysis; Design of algorithms; On line algorithms; Paging

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; DATA STRUCTURES; ONLINE SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES; STORAGE ALLOCATION (COMPUTER);

COMPETITIVE RANDOMIZED ALGORITHMS; MULTIPAGING;

DATA PROCESSING;

EID: 0032117373     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00080-5     Document Type: Article

References (9)

1. L.A. Belady, A study of replacement algorithms for a virtual storage computer, IBM Systems J. 5 (2) (1966) 78-101.
2. M. Farach, V. Liberatore, On local register allocation, in: Proc. Ninth ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 564-573.
3. E. Feuerstein, Paging more than one page, Theoret. Comput. Sci. 181 (1) (1997) 75-90.
4. A. Fiat, R.M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator, N.E. Young, Competitive paging algorithms, J. Algorithms 12 (4) (1991) 685-699.
5. S. Irani, A.R. Karlin, Online computation, in: D.S. Hochbaum (Ed.), Approximation Algorithms for NP-hard problems, PWS Publishing Company, Boston, MA, 1997, Chapter 13, pp. 521-564.
6. A.R. Karlin, M.S. Manasse, L. Rudolph, D.D. Sleator, Competitive snoopy caching, Algorithmica 3 (1) (1988) 79-119.
7. M.S. Manasse, L.A. McGeoch, D.D. Sleator, Competitive algorithms for server problems, J. Algorithms 11 (1990) 208-230.
8. L.A. McGeoch, D.D. Sleator, A strongly competitive randomized paging algorithm, Algorithmica 6 (6) (1991) 816-825.
9. D.D. Sleator, R.E. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM 28 (1985) 202-208.