In this paper, cache is the repository of browsing results located in cache disk. The size of cache repository and the choice of cache replacement algorithm affect the speed of a system. Improper deletion of an object during cache replacement may erase the most frequently used objects and cause misses during request. In this study, we propose a method of throughput improvement by combining FIFO (First in First Out) and LRU (Least Recently Used) cache replacement algorithms. The analysis was conducted to identify the effect of cache size on hit rate percentage, response time, delay time, and throughput when the combined FIFO-LRU algorithm is applied. The finding indicates bandwidth efficiency improvement compared to single algorithms, as showed by 73% throughput improvement on 200 MB cache. The application of the combined algorithm also reduces bandwidth usage and delay time while minimizing miss rate and increasing hit rate.
|Number of pages||6|
|Journal||ARPN Journal of Engineering and Applied Sciences|
|Publication status||Published - 2017|
- Cache size
- Hit rate