Improving Performance Of Distributed File System Through Frequent Block Access Pattern-Based Prefetching Algorithm

Prefetching is an important technique used in distributed file system for improving performance. In this paper, we have proposed a novel frequent access pattern-based prefetching algorithm for distributed file system that is implemented in an environment in which multiple types of storage devices such as hard disk, solid state drives and main memory are used. We have also proposed a new placement algorithm for file blocks which move file blocks from one level of memory to other levels of memory by considering the support of the file block access patterns. The combination of frequent access pattern-based prefetching and judicious placement of file blocks in the multiple memory devices in a static manner will reduce the average read access time of the distributed file system. Our simulation results indicate that the proposed algorithm can improve the performance of the distributed file system by considering average read access time and cache hits. For the performance comparison study purpose, we have considered the support-based prefetching algorithm.