Weighted Greedy Dual Size Frequency Based Caching Replacement Algorithm

Ma, Tinghuai; Qu, Jingjing; Shen, Wenhai; Tian, Yuan; Al-Dhelaan, Abdullah; Al-Rodhaan, Mznah

doi:10.1109/access.2018.2790381

Cited by 33 publications

(20 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When adding costs to enlarge the cache does not produce maximum hit rate performance, it can be stopped. This is consistent with the results of the study by Ma et al (2018) which stated that cache size should not be more than 50% because the cache cost is high. System designers believe that cache size only requires 0.1–0.3% of the total backend storage capacity (Deng et al , 2012).…”

Section: Caching Strategysupporting

confidence: 92%

“…Ma et al (2018) proposed a caching method called weighting size and cost replacement policy (WSCRP), which performed weighting calculations included cost, frequency and time variables. The result of weighting will be sorted.…”

Section: Caching Strategymentioning

confidence: 99%

“…The result of weighting will be sorted. This research is an improvement from previous research Ma et al (2018) called weighted greedy dual size frequency, which has not included the cost variable but has introduced a weighting mechanism for frequency-time and document weighting from the greedy-dual size frequency (GDSF) algorithm. When the cache is full, the cache object with the largest weight is replaced with a new object.…”

Section: Caching Strategymentioning

confidence: 99%

See 2 more Smart Citations

Caching strategy for Web application – a systematic literature review

Zulfa

Hartanto

Permanasari

2020

IJWIS

View full text Add to dashboard Cite

Purpose Internet users and Web-based applications continue to grow every day. The response time on a Web application really determines the convenience of its users. Caching Web content is one strategy that can be used to speed up response time. This strategy is divided into three main techniques, namely, Web caching, Web prefetching and application-level caching. The purpose of this paper is to put forward a literature review of caching strategy research that can be used in Web-based applications. Design/methodology/approach The methods used in this paper were as follows: determined the review method, conducted a review process, pros and cons analysis and explained conclusions. The review method is carried out by searching literature from leading journals and conferences. The first search process starts by determining keywords related to caching strategies. To limit the latest literature in accordance with current developments in website technology, search results are limited to the past 10 years, in English only and related to computer science only. Findings Note in advance that Web caching and Web prefetching are slightly overlapping techniques because they have the same goal of reducing latency on the user’s side. But actually, the two techniques are motivated by different basic mechanisms. Web caching uses the basic mechanism of cache replacement or the algorithm to change cache objects in memory when the cache capacity is full, whereas Web prefetching uses the basic mechanism of predicting cache objects that can be accessed in the future. This paper also contributes practical guidelines for choosing the appropriate caching strategy for Web-based applications. Originality/value This paper conducts a state-of-the art review of caching strategies that can be used in Web applications. Exclusively, this paper presents taxonomy, pros and cons of selected research and discusses data sets that are often used in caching strategy research. This paper also provides another contribution, namely, practical instructions for Web developers to decide the caching strategy.

show abstract

Section: Caching Strategysupporting

confidence: 92%

Section: Caching Strategymentioning

confidence: 99%

Section: Caching Strategymentioning

confidence: 99%

See 1 more Smart Citation

Caching strategy for Web application – a systematic literature review

Zulfa

Hartanto

Permanasari

2020

IJWIS

View full text Add to dashboard Cite

show abstract

“…The algorithm manages to keep document with higher cost in the cache memory while evicting the document with lower cost. Authors have considered another factor weighted frequency based time to improve the performance of GDA [27].…”

Section: Cost-based Replacement Algorithmsmentioning

confidence: 99%

A Categorical Study on Cache Replacement Policies for Hierarchical Cache Memory

Das

Roy

2020

Applications of Internet of Things

View full text Add to dashboard Cite

Cache memory plays an important role in the in-memory computation in memory-intensive applications. Hierarchical cache design is used to increase the capacity of cache to handle large working set. The last level cache (LLC) does not strictly follow the temporal locality of program, so it becomes challenging to identify the blocks that will not be reused (dead block). In this paper, we have performed a detail survey on different techniques to detect the dead blocks early in the cache memory and improve the hit rate of cache replacement algorithm. Belady's optimal solution detects the dead block by analyzing the future of blocks, which is completely un-realistic. Many researches have been done to detect dead block practically by observing the previous access pattern. Many algorithms are proposed to improve the performance of traditional replacement policies by considering different additional information. Most of the algorithm aims to reduce the miss count by retaining the blocks that will be reused before eviction (live blocks). Recent study observes that the cost of all the cache miss are not uniform in nature. So, some researchers have distinguished between high-cost block and low-cost block. The overall cost can be reduced by retaining the high-cost block in memory, with little higher miss count. It is observed that by managing cache miss un-coordinately among the different levels of cache memory, it is not possible to obtain maximum utilization of memory. Many adaptive algorithms have been proposed to maintain balance between the over-utilized blocks and underutilized blocks by the displacement of blocks. In this survey, we have categorized the practically implemented techniques into different classes based on their basic principle of cache replacement.

show abstract

“…Literature [11] jointly considered Mobile Edge Computing and Caching-enabled software-defined mobile networks to enhance the video service in next generation mobile networks. Literature [12] presented a novel caching replacement algorithm named Weighted Greedy Dual Size Frequency (WGDSF) algorithm, which is an improvement on the Greedy Dual Size Frequency (GDSF) algorithm. The WGDSF algorithm mainly adds weighted frequency-based time and weighted document type to GDSF for improving the caching hit ratio.…”

Section: Introductionmentioning

confidence: 99%

Hit Ratio Driven Mobile Edge Caching Scheme for Video on Demand Services

Chen

et al. 2019

2019 IEEE International Conference on Multimedia and Expo (ICME)

View full text Add to dashboard Cite

More and more scholars focus on mobile edge computing (MEC) technology, because the strong storage and computing capabilities of MEC servers can reduce the long transmission delay, bandwidth waste, energy consumption, and privacy leaks in the data transmission process. In this paper, we study the cache placement problem to determine how to cache videos and which videos to be cached in a mobile edge computing system. First, we derive the video request probability by taking into account video popularity, user preference and the characteristic of video representations. Second, based on the acquired request probability, we formulate a cache placement problem with the objective to maximize the cache hit ratio subject to the storage capacity constraints. Finally, in order to solve the formulated problem, we transform it into a grouping knapsack problem and develop a dynamic programming algorithm to obtain the optimal caching strategy. Simulation results show that the proposed algorithm can greatly improve the cache hit ratio.Index Terms-MEC, video-on-demand service, video cache, hit ratio, the grouping knapsack problem

show abstract

Weighted Greedy Dual Size Frequency Based Caching Replacement Algorithm

Cited by 33 publications

References 36 publications

Caching strategy for Web application – a systematic literature review

Caching strategy for Web application – a systematic literature review

A Categorical Study on Cache Replacement Policies for Hierarchical Cache Memory

Hit Ratio Driven Mobile Edge Caching Scheme for Video on Demand Services

Contact Info

Product

Resources

About