A reconfigurable multilevel parallel texture cache memory with 75-GB/s parallel cache replacement bandwidth

2002 ◽  
Vol 37 (5) ◽  
pp. 612-623 ◽  
Author(s):  
Se-Jeong Park ◽  
Jeong-Su Kim ◽  
Ramchan Woo ◽  
Se-Joong Lee ◽  
Kang-Min Lee ◽  
...  
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.


2020 ◽  
Vol 9 (2) ◽  
pp. 98-109
Author(s):  
Gunadi Pratama ◽  
Jajang Mulyana ◽  
Wawan Kusdiawan

Pada sebuah jaringan komputer terdapat Proxy server yang memiliki fungsi salah satunya caching. Mekanisme caching pada proxy server adalah menyimpan objek-objek yang merupakan hasil permintaan komputer client dari internet dan memberikan layanan jika client akan mengaksesnya kembali tanpa meminta sepenuhnya ke internet. Mengingat bahwa cache memory merupakan penyimpanan yang tetap maka dapat memungkinkan terjadinya cache memory penuh, untuk mengoptimalisasi kinerja cache memory terdapat metode cache replacement pada proxy server. Cache replacement pada proxy server merupakan metode penghapusan objek pada cache memory untuk digantikan dengan objek baru yang bertujuan agar cache memory tidak penuh. Maka dari itu penulis akan membangun sebuah proxy server web cache serta menganalisis algoritme Least recently used dan Greedy dual size frequently  sebagai aturan cache replacement pada squid proxy dengan menggunakan metode pengembangan Netwok Development Live Cycle (NDLC) Cisco PPDIOO. Kata kunci: Proxy server, Caching, Cache Replacement, LRU, GDSF, Cisco PPDIOO.


2015 ◽  
Vol 10 (6) ◽  
pp. 620 ◽  
Author(s):  
Prapai Sridama ◽  
Somchai Prakancharoen ◽  
Nalinpat Porrawatpreyakorn
Keyword(s):  

2016 ◽  
Vol E99.C (8) ◽  
pp. 936-946
Author(s):  
Ryotaro KOBAYASHI ◽  
Ikumi KANEKO ◽  
Hajime SHIMADA

Sign in / Sign up

Export Citation Format

Share Document