Lookahead scheduling requests for multisize page caching

This paper studies the effects of reordering page requests for multisize page caching. First, we consider a “semi-online” model, where an input queue keeps requests which will be processed in the future. It is assumed that they arrive during the processing time of miss requests. We develop an efficient page replacement algorithm which shifts some page requests in the queue. Second, we analyze the miss ratios of two methods, the nonshifting method and our shifting method, under the semi-online model. The analysis assumes that the input/output ratio of the queue is in equilibrium. Third, we compare our method with the other algorithms by simulation