Data Structures, Algorithms and Program Style Using C

Bostonxvi, 590 P.: illus.; 21.5 c

Reply to: "Notes on Hofshi and Korsh 1972"

Reply to: "Notes on Hofshi and Korsh 1972" (Joglekar, Prafulla. Notes on Hofshi and Korsh 1972. Management Sci. 22 (6) 717-720).

Finding Optimal Demand Paging Algorithms

A cost is defined for demand paging algorithms with respect to a formal stochastic model of program behavior. This cost is shown to exist under rather general assumptions, and a computational procedure is given which makes it possible to determine the optimal cost and optimal policy for moderate size programs, when the formal model is known and not time dependent. In this latter case it is shown that these computational procedures may be extended to larger programs to obtain arbitrarily close approximations to their optimal policies. In previous models either unwarranted information is assumed beyond the formal model, or the complete stochastic nature of the model is not taken into account

Reduction Algorithm for Zero-One Single Knapsack Problems

A simple algorithm is described for the reduction of 0-1 single knapsack problems to significantly smaller problems. The time required by the reduction algorithm is proportional to the number of variables. When used in conjunction with available algorithms for knapsack problems it substantially reduces total time and space requirements.