A proof of the optimality of the MIN paging algorithm using linear programming duality

Authors:
Ariel Cohen;Walter A. Burkhard
Affiliations:
Gemini Storage Systems Laboratory, Department of Computer Science and Engineering, University of California, San Diego, La Jolla, CA 92093-0114, USA;Gemini Storage Systems Laboratory, Department of Computer Science and Engineering, University of California, San Diego, La Jolla, CA 92093-0114, USA
Venue:
Operations Research Letters
Year:
1995

Citing 6
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Competitive paging algorithms

Journal of Algorithms
Competitive paging and dual-guided on-line weighted caching and watching algorithms

Competitive paging and dual-guided on-line weighted caching and watching algorithms
Operating Systems Theory

Operating Systems Theory
A study of replacement algorithms for a virtual-storage computer

IBM Systems Journal
Evaluation techniques for storage hierarchies

IBM Systems Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A linear programming formulation of the page replacement problem is used for proving the optimality of the MIN algorithm in a novel way. We describe an algorithm for constructing a solution for the dual problem such that the cost of this solution equals the cost of the MIN solution for the primal problem, thus proving the optimality of the MIN solution for paging, and the optimality of our algorithm for the paging dual (which is a special case of the assignment dual).