Lookahead Scheduling Requests for Multisize Page Caching

Authors:
Jun Kiniwa;Toshio Hamada;Daisuke Mizoguchi
Affiliations:
Kobe Univ. of Commerce, Hyogo, Japan;Kobe Univ. of Commerce, Hyogo, Japan;Net One Systems Co., Tokyo, Japan
Venue:
IEEE Transactions on Computers
Year:
2001

Citing 12
Cited 1

Amortized efficiency of list update and paging rules

Communications of the ACM
A priority queue with interruptions of service permitted after a time quantum

Acta Informatica
Competitive paging algorithms

Journal of Algorithms
Modern operating systems

Modern operating systems
The complexity of scheduling for data cache optimization

Information Sciences: an International Journal
Page replacement with multi-size pages and applications to Web caching

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Paging more than one page

Theoretical Computer Science - Special issue: Latin American theoretical informatics
On competitive on-line paging with lookahead

Theoretical Computer Science
Uniform multipaging reduces to paging

Information Processing Letters
Effects of Multithreading on Cache Performance

IEEE Transactions on Computers - Special issue on cache memory and related problems
A Dynamic Time-Sharing Priority Queue

Journal of the ACM (JACM)
Cache Memories

ACM Computing Surveys (CSUR)

Online interval scheduling on a single machine with finite lookahead

Computers and Operations Research

Quantified Score

Hi-index	14.98

Visualization

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.