An efficient cache management algorithm for streaming workloads

Kyungwoon Cho and Hyokyung Bahn

International Journal of Networking and Virtual Organisations, 2020, vol. 22, issue 4, 402-414

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.

Keywords: caching algorithm; interval caching; LRU algorithm; streaming workload; sequential access; buffer caching; I/O bandwidth; cache hit ratio. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=107574 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijnvor:v:22:y:2020:i:4:p:402-414

Access Statistics for this article

More articles in International Journal of Networking and Virtual Organisations from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().