A PROOF OF THE OPTIMALITY OF THE MIN PAGING ALGORITHM USING LINEAR PROGRAMMING DUALITY

摘要

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). [References: 8]