Improving Performance of Distributed File System through Frequent Block Access Pattern-Based Prefetching Algorithm

Nalajala, Anusha; Ragunathan, T.; Rajendra, Sri Harsha Tavidisetty; Nikhith, Nagamlla Venkata Sai; Gopisetty, Rathnamma

doi:10.1109/icccnt45670.2019.8944405

Cited by 8 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We considered one lakh sessions of requests for every simulation run to calculate the average read access time (ARAT). We have compared the performance of our HRFP algorithm with Hadoop without caching(HDFS [57]), Hadoop with caching (Dcache) [27], SBFBAP (support-based frequent patterns prefetching and caching) algorithm [58], Support-based prefetching and (SBMS) algorithm [15] by following multi-level caching. Furthermore we also tested the HRFP algorithm performance with LRU (least recently used) [4] replacement policy rather than using a relevancy-based replacement procedure.…”

Section: Methodsmentioning

confidence: 99%

HRFP: Highly Relevant Frequent Patterns-Based Prefetching and Caching Algorithms for Distributed File Systems

et al. 2023

Self Cite

View full text Add to dashboard Cite

Data-intensive applications are generating massive amounts of data which is stored on cloud computing platforms where distributed file systems are utilized for storage at the back end. Most users of those applications deployed on cloud computing systems read data more often than they write. Hence, enhancing the performance of read operations is an important research issue. Prefetching and caching are used as important techniques in the context of distributed file systems to improve the performance of read operations. In this research, we introduced a novel highly relevant frequent patterns (HRFP)-based algorithm that prefetches content from the distributed file system environment and stores it in the client-side caches that are present in the same environment. We have also introduced a new replacement policy and an efficient migration technique for moving the patterns from the main memory caches to the caches present in the solid-state devices based on a new metric namely the relevancy of the patterns. According to the simulation results, the proposed approach outperformed other algorithms that have been suggested in the literature by a minimum of 15% and a maximum of 53%.

show abstract

Section: Methodsmentioning

confidence: 99%

HRFP: Highly Relevant Frequent Patterns-Based Prefetching and Caching Algorithms for Distributed File Systems

et al. 2023

Self Cite

View full text Add to dashboard Cite

show abstract

“…Each segment file corresponds to a video part and establishes an index list for the file segment, mainly for the HLS video, 33,34 and for RTSP video, RTSP is converted into HLS segments for transmission, 35 but the protocol has changed; Another method is memory prefetch. Its basic principle is that when reading the current file segment, multithreading pre read the next segment into memory at the same time 36‐38 …”

Section: Related Workmentioning

confidence: 99%

“…Its basic principle is that when reading the current file segment, multithreading pre read the next segment into memory at the same time. [36][37][38] In any case, the existing methods to improve the throughput of the VOD system do not take the architecture and solution of VR FOR solution into consideration, and our solution aims to improve it.…”

Section: Cdn Optimizationmentioning

confidence: 99%

TVSR‐OR: Tile‐based 360‐degree video streaming over real time streaming protocol with optimized read

Zeng

Yin

et al. 2023

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Among video application use cases and scenarios, 360-degree video applications gradually become significant. The state-of-the-art solution for 360-degree video streaming is field of view (FOV) transmission, whose quality of experience highly depends on system processing speed and network latency. The extant 360-degree video FOV transmission profiles transmit multiple video tile streams to the client over either Hypertext Transfer Protocol (HTTP) or Real Time Streaming Protocol (RTSP). The client needs to merge all different tile streams after receiving them, which may cause a data synchronization problem of waiting for each tile to sync in the presents of packet losses. Therefore, we propose a system to select and merge tile streams on the Content Delivery Network (CDN) server and transmit the merged stream to the client. During the streaming service, the client can send a viewport switch request through RTSP signaling, and the server will subsequently deliver the merged video stream of the new viewport to the client after receiving the request. Also, to reduce disk overhead from parallel reads, we optimize the system with a file prefetch strategy to reduce unorganized, random, and parallel reads into serialized reads of large data trunks. We evaluate its performance through user request simulation experiments. Compared with the extant transmission solution, our system provides slightly lower video transmission latency, lower central processing unit (CPU) usage, and better disk performance under heavy service load.

show abstract

“…The prefetching techniques discussed in the literature mainly focus on prefetching popular files, file blocks, and access patterns depending on prediction, either on frequency or on the relevancy of the data. In [22], we proposed a supportbased frequent file block access pattern prefetching technique to reduce the average read access time of the distributed file system. In [23], we proposed rank-based prefetching techniques based on support and access timestamp.…”

Section: A Prefetching Techniquesmentioning

confidence: 99%

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

Improving Performance of Distributed File System through Frequent Block Access Pattern-Based Prefetching Algorithm

Cited by 8 publications

References 6 publications

HRFP: Highly Relevant Frequent Patterns-Based Prefetching and Caching Algorithms for Distributed File Systems

HRFP: Highly Relevant Frequent Patterns-Based Prefetching and Caching Algorithms for Distributed File Systems

TVSR‐OR: Tile‐based 360‐degree video streaming over real time streaming protocol with optimized read

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

Contact Info

Product

Resources

About