A page replacement algorithm based on a fuzzy approach to improve cache memory performance

2019 ◽  
Vol 24 (2) ◽  
pp. 955-963 ◽  
Author(s):  
Davood Akbari Bengar ◽  
Ali Ebrahimnejad ◽  
Homayun Motameni ◽  
Mehdi Golsorkhtabaramiri
2020 ◽  
Vol 39 (5) ◽  
pp. 7899-7908
Author(s):  
Davood Akbari-Bengar ◽  
Ali Ebrahimnejad ◽  
Homayun Motameni ◽  
Mehdi Golsorkhtabaramiri

Internet is one of the most influential new communication technologies has influenced all aspects of human life. Extensive use of the Internet and the rapid growth of network services have increased network traffic and ultimately a slowdown in internet speeds around the world. Such traffic causes reduced network bandwidth, server response latency, and increased access time to web documents. Cache memory is used to improve CPU performance and reduce response time. Due to the cost and limited size of cache compared to other devices that store information, an alternative policy is used to select and extract a page to make space for new pages when the cache is filled. Many algorithms have been introduced which performance depends on a high-speed web cache, but it is not well optimized. The general feature of most of them is that they are developed from the famous LRU and LFU designs and take advantage of both designs. In this research, a page replacement algorithm called FCPRA (Fuzzy Clustering based Page Replacement Algorithm) is presented, which is based on four features. When the cache space can’t respond to a request for a new page, it selects a page of the lowest priority cluster and the largest login order; then, removes it from the cache memory. The results show that FCPRA has a better hit rate with different data sets and can improve the cache memory performance compared to other algorithms.


Author(s):  
A. V. Vishnekov ◽  
E. M. Ivanova

The paper investigates the issues of increasing the performance of computing systems by improving the efficiency of cache memory, analyzes the efficiency indicators of replacement algorithms. We show the necessity of creation of automated or automatic means for cache memory tuning in the current conditions of program code execution, namely a dynamic cache replacement algorithms control by replacement of the current replacement algorithm by more effective one in current computation conditions. Methods development for caching policy control based on the program type definition: cyclic, sequential, locally-point, mixed. We suggest the procedure for selecting an effective replacement algorithm by support decision-making methods based on the current statistics of caching parameters. The paper gives the analysis of existing cache replacement algorithms. We propose a decision-making procedure for selecting an effective cache replacement algorithm based on the methods of ranking alternatives, preferences and hierarchy analysis. The critical number of cache hits, the average time of data query execution, the average cache latency are selected as indicators of initiation for the swapping procedure for the current replacement algorithm. The main advantage of the proposed approach is its universality. This approach assumes an adaptive decision-making procedure for the effective replacement algorithm selecting. The procedure allows the criteria variability for evaluating the replacement algorithms, its’ efficiency, and their preference for different types of program code. The dynamic swapping of the replacement algorithm with a more efficient one during the program execution improves the performance of the computer system.


1986 ◽  
Vol 14 (3) ◽  
pp. 41-61 ◽  
Author(s):  
Cedell Alexander ◽  
William Keshlear ◽  
Furrokh Cooper ◽  
Faye Briggs

2014 ◽  
Vol 98 (19) ◽  
pp. 27-33 ◽  
Author(s):  
Pancham Pancham ◽  
Deepak Chaudhary ◽  
Ruchin Gupta

Author(s):  
◽  

Data or instructions that are regularly used are saved in cache so that it is very easy to retrieve for the purpose of increase the cache performance. Evaluating the execution of multi-core systems the part of the cache memory is very important. A multicore processor is shared circuit in which two or more processors are joined to enhance the performance and perform multiple tasks. This paper describes the performance of cache memory based on cache access time, miss rate and miss penalty. Cache mapping methods are defined to increase the performance of cache but it face many difficulties. Some methods and algorithms are used to decrease these difficulties. In this paper describes the study of recent competing processors to evaluate the cache memory performance.


1991 ◽  
Vol 22 (6) ◽  
pp. 733-746 ◽  
Author(s):  
Ashfaq Hossain ◽  
Anaikuppam R. Marudarajan ◽  
Mahmoud A. Manzoul

Sign in / Sign up

Export Citation Format

Share Document