This Article 
 Bibliographic References 
 Add to: 
Lookahead Scheduling Requests for Multisize Page Caching
September 2001 (vol. 50 no. 9)
pp. 972-983

Abstract—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.

[1] E. Feuerstein, “Paging More than One Page,” Theoretical Computer Science, vol. 181, pp. 75-90, July 1997.
[2] S. Irani, “Page Replacement with Multisize Pages and Applications to Web Caching,” Proc. 29th Ann. ACM Symp. Theory of Computing, pp. 701-710, May 1997.
[3] V. Liberatore, “Uniform Multipaging Reduces to Paging,” Information Processing Letters, vol. 67, pp. 9-12, July 1998.
[4] L.A. Belady, “A Study of Replacement Algorithms for a Virtual-Storage Computer,” IBM System J., vol. 5, no. 2, pp. 78-101, 1966.
[5] A.J. Smith, "Cache Memories," ACM Computing Surveys, Vol. 14, 1982, pp. 473-540.
[6] A.S. Tanenbaum, Modern Operating Systems. McGraw Hill, 1991.
[7] D. Sleator and R. Tarjan, “Amortized Efficiency of List Update and Paging Rules,” Comm. ACM, vol. 28, no. 2, pp. 202–208, 1985.
[8] S. Albers, “On the Influence of Lookahead in Competitive Paging Algorithms,” Algorithmica, vol. 18, no. 3, pp. 283-305, July 1997.
[9] S. Ben-David and A. Borodin, “A New Measure for the Study of On-Line Algorithms,” Algorithmica, vol. 11, no. 1, pp. 73-91, Jan. 1994.
[10] D. Breslauer, “On Competitive On-Line Paging with Lookahead,” Theoretical Computer Science, vol. 209, nos. 1-2, pp. 365-375, Dec. 1998.
[11] E. Koutsoupias and C.H. Papadimitriou, “Beyond Competitive Analysis,” Proc. 35th IEEE Symp. Foundations of Computer Science, pp. 394-400, Nov. 1994.
[12] A. Yanbe and K. Sakurai, “Design and Analysis of an Optimal Strategy in Online Paging Game with Lookahead,” RIMS Kokyuroku, no. 992, Feb. 1997.
[13] I. Adiri, “A Dynamic Time-Sharing Priority Queue,” J. ACM, vol. 18, no. 4, pp. 603-610, Oct. 1971.
[14] B. Rembowski, “A Priority Queue with Interruptions of Service Permitted after a Time Quantum,” Acta Informatica, vol. 22, no. 3, pp. 241-251, 1985.
[15] S.M. Ross, Introduction to Probability Models, chapter 8, sixth ed.. San Diego, Calif.: Academic Press, 1997.
[16] M. Pinedo and G. Weiss, “Scheduling of Stochastic Tasks on Two Parallel Processors,” Naval Research Logistics Quarterly, vol. 26, no. 3, pp. 527-535, 1979.
[17] A.R. Hurson, S. Yoon, H. Kwak, B. Lee, and W. Hahn, “Effects of Multithreading on Cache Performance,” IEEE Trans. Computers, vol. 48, no. 2, pp. 176-184, Feb. 1999.
[18] D. Gupta, B. Malloy, and A. Mcrae, “The Complexity of Scheduling for Data Cache Optimization,” Information Sciences, vol. 100, pp. 27-48, 1997.
[19] L. Kleinrock, Queueing Systems—Volume 1: Theory, chapter 5, first ed.. New York: John Wiley&Sons, 1975.
[20] A. Fiat, R. Karp, M. Luby, L.A. McGeoch, D. Sleator, and N.E. Yong, "Competitive Paging Algorithms," J. Algorithms, vol. 12, pp. 685-699, 1991

Index Terms:
Multisize page caching, semi-online model, queue, page replacement algorithm, simulation.
Jun Kiniwa, Toshio Hamada, Daisuke Mizoguchi, "Lookahead Scheduling Requests for Multisize Page Caching," IEEE Transactions on Computers, vol. 50, no. 9, pp. 972-983, Sept. 2001, doi:10.1109/12.954511
Usage of this product signifies your acceptance of the Terms of Use.