IDEAS home Printed from https://ideas.repec.org/a/ids/ijnvor/v22y2020i4p402-414.html
   My bibliography  Save this article

An efficient cache management algorithm for streaming workloads

Author

Listed:
  • Kyungwoon Cho
  • Hyokyung Bahn

Abstract

In this paper, we present a novel cache management algorithm for real-world streaming workloads. Streaming workloads are believed to exhibit very large and sequential access patterns, which has been the main consideration in designing media caching algorithms. However, legacy caching algorithms do not fully utilise fine-grained access patterns of streaming workloads and also tend to ignore human interactivity. In this paper, we present the least expectation first (LEF) algorithm, which manages a large number of block caches as two-level grouping. Specifically, we select caching and eviction targets based on the expected gain of the cached data blocks, thereby improving the cache hit ratio significantly. Experimental results show that the proposed algorithm performs better than well-known interval caching and LRU algorithms with respect to the hit ratio and the I/O bandwidth.

Suggested Citation

  • Kyungwoon Cho & Hyokyung Bahn, 2020. "An efficient cache management algorithm for streaming workloads," International Journal of Networking and Virtual Organisations, Inderscience Enterprises Ltd, vol. 22(4), pages 402-414.
    • Handle: RePEc:ids:ijnvor:v:22:y:2020:i:4:p:402-414
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=107574
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijnvor:v:22:y:2020:i:4:p:402-414. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=22 .

    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.