Purpose. Big data is a very large vocabulary we have heard recently. No matter for business or personal users, there is always a lot of important data to store. When we use the storage system, we often want the system to respond quickly enough to reach a state of no delay. This is a big challenge to the storage system. Scientists have already done many researches on this topic and they found that the use of cache in the storage system can improve the performance of storage system greatly. Methodology. Cache algorithm is a hot research field in the current storage area. Least Recently Used algorithm (LRU) is a commonly used cache replacement algorithm. Findings. Since the new hash value that appears atop of the stack needs to adjust the stack even if the visited page is already in memory, this takes much time. We need a better cache replacement algorithm to improve the performance. Originality. A new replacing strategy based on the LRU algorithm has been developed; it is called Improved LRU algorithm (ILRU). It can increase the hit rate when more users suddenly have a higher access to the unfamiliar page. We determine whether the hash value is added to a page or not through searching the access hash value in the LRU queue. Practical value. The test results show that the design of ILRU algorithm can improve the performance comparing to traditional LRU algorithm. At the same time, ILRU algorithm has higher hit rate than FIFO algorithm.

  Якщо, ви не знайшли інформацію про автора(ів) публікації, маєте бажання виправити або відобразити більш докладну інформацію про науковців України запрошуємо заповнити "Анкету науковця"