Support-Based Prefetching Technique for Hierarchical Collaborative Caching Algorithm to Improve the Performance of a Distributed File System

Gopisetty, Rathnamma; Ragunathan, T.; Bindu, C. Shoba

doi:10.1109/paap.2015.28

Cited by 4 publications

(9 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this system, a server push approach is used to prefetch the file data, which creates unnecessary overhead on the servers and results in performance degradation. The authors introduced prefetching of popular file blocks based on the simple support value in [20] [21]. The prefetched data (file blocks) were cached in the memory hierarchy.…”

Section: A Prefetching Techniquesmentioning

confidence: 99%

“…Hermes [19] Distributed Unnecessary overhead on servers. Support-based prefetching [20] [21] Distributed Frequency based prefetching.…”

Section: Approachmentioning

confidence: 99%

“…We calculated the support values for files and their respective file blocks from the log entries recorded in the local DNDs following the procedure discussed in Section III-B. Note that, the threshold for finding popular files and file blocks is fixed at 0.6 based on [20]. DND_FF_list is used to store files with support values higher than the specified threshold.…”

Section: ) Afpmc Ranking Algorithmmentioning

confidence: 99%

“…It is important to note that all remaining proposed algorithms use the same caching procedure. We have modified the support-based prefetching technique discussed in the literature [20] by considering multi-level memories to cache the prefetched data and named the algorithm support based prefetching and multi-level caching algorithm (SMPC). We also modified the Dcache algorithm (Dcache) discussed in the literature [41] by considering a global cache.…”

Section: B Prefetching Algorithms and Client-side Caching Techniquesmentioning

confidence: 99%

“…This task runs continuously in parallel with all other applications and user initiated tasks in the DFS environment. Based on [20], we defined a threshold value for the hit ratio of all the specified caches. Whenever the hit ratio falls below this value, the process of prefetching is re-initiated without affecting the other operations.…”

Section: E Prefetch Re-initiationmentioning

confidence: 99%

See 4 more Smart Citations

Efficient Prefetching and Client-Side Caching Algorithms for Improving the Performance of Read Operations in Distributed File Systems

2022

View full text Add to dashboard Cite

Modern web applications are deployed in cloud computing systems because they support unlimited storage and computing power. One of the main back-end storage components of this cloud computing system is the distributed file system which allows massive amounts of data to be stored and accessed. In most web applications deployed in such systems, read operations are performed more frequently than write operations. Consequently, increasing the efficiency of read operations in distributed file systems is a challenging and important research problem. The two main procedures used in distributed file systems to improve the performance of read operations are prefetching and caching. In this paper, we proposed novel prefetching and multi-level caching algorithms based on the Access-Frequency and Access-Recency ranking of file blocks that were previously accessed by client application programs. We also proposed new augmented ranking algorithms for prefetching file blocks by combining the Access-Frequency and Access-Recency ranking of the file blocks. We used rank-based replacement algorithms to replace file blocks in the cache. The simulation results show that, the proposed algorithms improve the performance of read operations on distributed file systems by 29% to 77% in comparison to algorithms proposed in the literature.

show abstract

Section: A Prefetching Techniquesmentioning

confidence: 99%

“…Hermes [19] Distributed Unnecessary overhead on servers. Support-based prefetching [20] [21] Distributed Frequency based prefetching.…”

Section: Approachmentioning

confidence: 99%

Section: ) Afpmc Ranking Algorithmmentioning

confidence: 99%

Section: B Prefetching Algorithms and Client-side Caching Techniquesmentioning

confidence: 99%

Section: E Prefetch Re-initiationmentioning

confidence: 99%