IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v58y2010i4-part-1p971-984.html
   My bibliography  Save this article

Analysis of Page Replacement Policies in the Fluid Limit

Author

Listed:
  • Ryo Hirade

    (IBM Research---Tokyo, Yamato-shi, Kanagawa 242-8502, Japan)

  • Takayuki Osogami

    (IBM Research---Tokyo, Yamato-shi, Kanagawa 242-8502, Japan)

Abstract

The performance of storage systems and database systems depends significantly on the page replacement policies. Although many page replacement policies have been discussed in the literature, their performances are not fully understood. We introduce analytical techniques for evaluating the performances of page replacement policies including two queue ( 2Q ), which manages two buffers to capture both the recency and frequency of requests. We derive an exact expression for the probability that a requested item is found (the hit probability) in a buffer managed by 2Q in the fluid limit, where the number of items is scaled by n , the size of items is scaled by 1/ n , and n approaches infinity. The hit probability in the fluid limit approximates the hit probability in the original system, and we find that the relative error in the approximation is typically within 1%. Our analysis also illuminates several fundamental properties of 2Q useful for system designers.

Suggested Citation

  • Ryo Hirade & Takayuki Osogami, 2010. "Analysis of Page Replacement Policies in the Fluid Limit," Operations Research, INFORMS, vol. 58(4-part-1), pages 971-984, August.
    • Handle: RePEc:inm:oropre:v:58:y:2010:i:4-part-1:p:971-984
    DOI: 10.1287/opre.1090.0761
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1090.0761
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1090.0761?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. John McCabe, 1965. "On Serial Files with Relocatable Records," Operations Research, INFORMS, vol. 13(4), pages 609-618, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nicolas Gast & Benny Houdt, 2016. "Transient and steady-state regime of a family of list-based cache replacement algorithms," Queueing Systems: Theory and Applications, Springer, vol. 83(3), pages 293-328, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Leisen, Fabrizio & Lijoi, Antonio & Paroissin, Christian, 2011. "Limiting behavior of the search cost distribution for the move-to-front rule in the stable case," Statistics & Probability Letters, Elsevier, vol. 81(12), pages 1827-1832.
    2. Gerhard Hasslinger & Konstantinos Ntougias & Frank Hasslinger & Oliver Hohlfeld, 2023. "Scope and Accuracy of Analytic and Approximate Results for FIFO, Clock-Based and LRU Caching Performance," Future Internet, MDPI, vol. 15(3), pages 1-17, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:58:y:2010:i:4-part-1:p:971-984. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.