Relevant bibliographies by topics / Cache replacement algorithms

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Cache replacement algorithms'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Cache replacement algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Cache replacement algorithms"

1

Lyons, Steven, and Raju Rangaswami. "To Cache or Not to Cache." Algorithms 17, no. 7 (2024): 301. http://dx.doi.org/10.3390/a17070301.

Full text
Abstract:
Unlike conventional CPU caches, non-datapath caches, such as host-side flash caches which are extensively used as storage caches, have distinct requirements. While every cache miss results in a cache update in a conventional cache, non-datapath caches allow for the flexibility of selective caching, i.e., the option of not having to update the cache on each miss. We propose a new, generalized, bimodal caching algorithm, Fear Of Missing Out (FOMO), for managing non-datapath caches. Being generalized has the benefit of allowing any datapath cache replacement policy, such as LRU, ARC, or LIRS, to
APA, Harvard, Vancouver, ISO, and other styles
2

WANG, JAMES Z., and VIPUL BHULAWALA. "DESIGN AND IMPLEMENTATION OF A P2P COOPERATIVE PROXY CACHE SYSTEM." Journal of Interconnection Networks 08, no. 02 (2007): 147–62. http://dx.doi.org/10.1142/s0219265907001953.

Full text
Abstract:
In this paper, we design and implement a P2P cooperative proxy caching system based on a novel P2P cooperative proxy caching scheme. To effectively locate the cached web documents, a TTL-based routing protocol is proposed to manage the query and response messages in the P2P cooperative proxy cache system. Furthermore, we design a predict query-route algorithm to improve the TTL-based routing protocol by adding extra information in the query message packets. To select a suitable cache replacement algorithm for the P2P cooperative proxy cache system, three different cache replacement algorithms,
APA, Harvard, Vancouver, ISO, and other styles
3

Vishnekov, A. V., and E. M. Ivanova. "DYNAMIC CONTROL METHODS OF CACHE LINES REPLACEMENT POLICY." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 191 (May 2020): 49–56. http://dx.doi.org/10.14489/vkit.2020.05.pp.049-056.

Full text
Abstract:
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, sequentia
APA, Harvard, Vancouver, ISO, and other styles
4

Vishnekov, A. V., and E. M. Ivanova. "DYNAMIC CONTROL METHODS OF CACHE LINES REPLACEMENT POLICY." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 191 (May 2020): 49–56. http://dx.doi.org/10.14489/vkit.2020.05.pp.049-056.

Full text
Abstract:
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, sequentia
APA, Harvard, Vancouver, ISO, and other styles
5

Prihozhy, A. A. "Simulation of direct mapped, k-way and fully associative cache on all pairs shortest paths algorithms." «System analysis and applied information science», no. 4 (December 30, 2019): 10–18. http://dx.doi.org/10.21122/2309-4923-2019-4-10-18.

Full text
Abstract:
Caches are intermediate level between fast CPU and slow main memory. It aims to store copies of frequently used data and to reduce the access time to the main memory. Caches are capable of exploiting temporal and spatial localities during program execution. When the processor accesses memory, the cache behavior depends on if the data is in cache: a cache hit occurs if it is, and, a cache miss occurs, otherwise. In the last case, the cache may have to evict other data. The misses produce processor stalls and slow down the computations. The replacement policy chooses a data to evict, trying to p
APA, Harvard, Vancouver, ISO, and other styles
6

Begum, B. Shameedha, and N. Ramasubramanian. "Design of an Intelligent Data Cache with Replacement Policy." International Journal of Embedded and Real-Time Communication Systems 10, no. 2 (2019): 87–107. http://dx.doi.org/10.4018/ijertcs.2019040106.

Full text
Abstract:
Embedded systems are designed for a variety of applications ranging from Hard Real Time applications to mobile computing, which demands various types of cache designs for better performance. Since real-time applications place stringent requirements on performance, the role of the cache subsystem assumes significance. Reconfigurable caches meet performance requirements under this context. Existing reconfigurable caches tend to use associativity and size for maximizing cache performance. This article proposes a novel approach of a reconfigurable and intelligent data cache (L1) based on replaceme
APA, Harvard, Vancouver, ISO, and other styles
7

Zulfa, Mulki Indana, Ari Fadli, Adhistya Erna Permanasari, and Waleed Ali Ahmed. "Performance comparison of cache replacement algorithms onvarious internet traffic." JURNAL INFOTEL 15, no. 1 (2023): 1–7. http://dx.doi.org/10.20895/infotel.v15i1.872.

Full text
Abstract:
Internet users tend to skip and look for alternative websites if they have slow response times. For cloud network managers, implementing a caching strategy on the edge network can help lighten the workload of databases and application servers. The caching strategy is carried out by storing frequently accessed data objects in cache memory. Through this strategy, the speed of access to the same data becomes faster. Cache replacement is the main mechanism of the caching strategy. There are seven cache replacement algorithms with good performance that can be used, namely LRU, LFU, LFUDA, GDS, GDSF
APA, Harvard, Vancouver, ISO, and other styles
8

Liu, Tian, Wei Zhang, Tao Xu, and Guan Wang. "Research and Analysis of Design and Optimization of Magnetic Memory Material Cache Based on STT-MRAM." Key Engineering Materials 815 (August 2019): 28–34. http://dx.doi.org/10.4028/www.scientific.net/kem.815.28.

Full text
Abstract:
This paper proposes a cache replacement algorithm based on STT-MRAM magnetic memory, which aims to make the material system based on STT-MRAM magnetic memory better used. The algorithm replaces the data blocks in the cache by considering the position of the STT-MRAM magnetic memory head and the hardware characteristics of the STT-MRAM magnetic memory. This method will be different from the traditional magnetic memory-based common cache replacement algorithm. Traditional replacement algorithms are generally designed with only the algorithm to improve the cache, and the hardware characteristics
APA, Harvard, Vancouver, ISO, and other styles
9

Pratheeksha, P., and SA Revathi. "Machine Learning-Based Cache Replacement Policies: A Survey." International Journal of Engineering and Advanced Technology (IJEAT) 10, no. 6 (2021): 19–22. https://doi.org/10.35940/ijeat.F2907.0810621.

Full text
Abstract:
Despite extensive developments in improving cache hit rates, designing an optimal cache replacement policy that mimics Belady’s algorithm still remains a challenging task. Existing standard static replacement policies does not adapt to the dynamic nature of memory access patterns, and the diversity of computer programs only exacerbates the problem. Several factors affect the design of a replacement policy such as hardware upgrades, memory overheads, memory access patterns, model latency, etc. The amalgamation of a fundamental concept like cache replacement with advanced machine learning
APA, Harvard, Vancouver, ISO, and other styles
10

Yeung, Kai-Hau, and Kin-Yeung Wong. "An Unifying Replacement Approach for Caching Systems." Journal of Communications Software and Systems 3, no. 4 (2007): 256. http://dx.doi.org/10.24138/jcomss.v3i4.247.

Full text
Abstract:
A cache replacement algorithm called probability based replacement (PBR) is proposed in this paper. The algorithm makes replacement decision based on the byte accessprobabilities of documents. This concept can be applied to both small conventional web documents and large video documents. The performance of PBR algorithm is studied by both analysis and simulation. By comparing cache hit probability, hit rate and average time spent in three systems, it is shown that the proposed algorithm outperforms the commonly used LRU and LFU algorithms. Simulation results show that, when large video documen
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Cache replacement algorithms"

1

Altman, Erik R. (Erik Richter). "Genetic algorithms and cache replacement policy." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61096.

Full text
Abstract:
The most common and generally best performing replacement algorithm in modern caches is LRU. Despite LRU's superiority, it is still possible that other feasible and implementable replacement policies could yield better performance. (34) found that an optimal replacement policy (OPT) would often have a miss rate 70% that of LRU.<br>If better replacement policies exist, they may not be obvious. One way to find better policies is to study a large number of address traces for common patterns. Such an undertaking involves such a large amount of data, that some automated method of generating and eva
APA, Harvard, Vancouver, ISO, and other styles
2

Moreira, Josilene Aires. "Cache strategies for internet-based video on-demand distribution." Universidade Federal de Pernambuco, 2011. https://repositorio.ufpe.br/handle/123456789/1659.

Full text
Abstract:
Made available in DSpace on 2014-06-12T15:51:44Z (GMT). No. of bitstreams: 2 arquivo2806_1.pdf: 3483412 bytes, checksum: cab776dc5a3fdf07c8cda900906f6a98 (MD5) license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2011<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>Aires Moreira, Josilene; Fawzi Hadj Sadok, Djamel. Cache strategies for internet-based video on-demand distribution. 2011. Tese (Doutorado). Programa de Pós-Graduação em Ciência da Computação, Universidade Federal de Pernambuco, Recife, 2011.
APA, Harvard, Vancouver, ISO, and other styles
3

Valero, Bresó Alejandro. "Hybrid caches: design and data management." Doctoral thesis, Editorial Universitat Politècnica de València, 2013. http://hdl.handle.net/10251/32663.

Full text
Abstract:
Cache memories have been usually implemented with Static Random-Access Memory (SRAM) technology since it is the fastest electronic memory technology. However, this technology consumes a high amount of leakage currents, which is a major design concern because leakage energy consumption increases as the transistor size shrinks. Alternative technologies are being considered to reduce this consumption. Among them, embedded Dynamic RAM (eDRAM) technology provides minimal area and leakage by design but reads are destructive and it is not as fast as SRAM. In this thesis, both SRAM and eDRAM te
APA, Harvard, Vancouver, ISO, and other styles
4

Madhugiri, Shamsundar Abhiram. "Probability based cache replacement algorithm for the hypervisor cache." Thesis, Wichita State University, 2012. http://hdl.handle.net/10057/5532.

Full text
Abstract:
Virtualization is one of the key technologies which help in server consolidation, disaster recovery, and dynamic load balancing. The ratio of virtual machine to physical machine can be as high as 1:10, and this makes caching a key parameter, which affects the performance of Virtualization. Researchers have proposed the idea of having an exclusive hypervisor cache at the Virtual Machine Monitor (VMM) which could ease congestion and also improve the performance of the caching mechanism. Traditionally the Least Recently Used (LRU) algorithm is the cache replacement policy used in most caches. Thi
APA, Harvard, Vancouver, ISO, and other styles
5

PUZAK, THOMAS ROBERTS. "ANALYSIS OF CACHE REPLACEMENT-ALGORITHMS." 1985. https://scholarworks.umass.edu/dissertations/AAI8509594.

Full text
Abstract:
This thesis describes a model used to analyze the replacement decisions made by LRU and OPT (Least-Recently-Used and an optimal replacement-algorithm). The model identifies a set of lines in the LRU cache that are dead, that is, lines that must leave the cache before they can be rereferenced. The model shows that the majority of the cache misses that OPT avoids over LRU come from the most-recently-discarded lines of the LRU cache. Also shown is that a very small set of lines account for the majority of the misses that OPT avoids over LRU. OPT requires perfect knowledge of the future and is not
APA, Harvard, Vancouver, ISO, and other styles
6

Katti, Anil Kumar. "Competitive cache replacement strategies for a shared cache." Thesis, 2011. http://hdl.handle.net/2152/ETD-UT-2011-05-3584.

Full text
Abstract:
We consider cache replacement algorithms at a shared cache in a multicore system which receives an arbitrary interleaving of requests from processes that have full knowledge about their individual request sequences. We establish tight bounds on the competitive ratio of deterministic and randomized cache replacement strategies when processes share memory blocks. Our main result for this case is a deterministic algorithm called GLOBAL-MAXIMA which is optimum up to a constant factor when processes share memory blocks. Our framework is a generalization of the application controlled caching framewo
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Po Yao, and 王柏堯. "Wildcard Rule Caching and Cache Replacement Algorithms in Software-Defined Networking." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/g4y8ty.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

HSIEH, JUNG-MING, and 謝榮明. "Replacement Algorithms for Web Cache Server based on Least Frequency Ratios." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/37757226777565797999.

Full text
Abstract:
碩士<br>國立臺灣大學<br>電機工程學研究所<br>91<br>Web Cache Server can reduce response time of Web Server, transmission amount of data, transmission delay and the chance of network bottom, such that Web Server can service more users and bandwidth is utilized better. But Web pages are inestimable and the resources are limit in Web Cache Server. It can’t contain Web pages of all users request. The Replacement Algorithms are a good solution for utility of limited resources and reducing access cost of clients and Web Server. Many algorithms are proposed for limited cache space can satisfy infinite request , fo
APA, Harvard, Vancouver, ISO, and other styles
9

Chuo, Yen Cheng, and 卓彥呈. "Wildcard Rules Caching and Cache Replacement Algorithms in Software-Defined Networks." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/24916124967374174007.

Full text
Abstract:
碩士<br>國立清華大學<br>資訊工程學系<br>103<br>In Software-Defined Networking, flow tables of OpenFlow switches are implemented by ternary content addressable memory (TCAM). Although TCAM can process input packets in high speed, TCAM has four shortcomings, TCAM capacity, power consumption, heat generation, and board space problems. Rules caching is a technique to solve the TCAM capacity problem which is the most important problem in TCAM. However, the rule dependency problem is a challenging issue for wildcard rules caching where packets could mismatch rules. In this paper, we use cover set to solve rule de
APA, Harvard, Vancouver, ISO, and other styles
10

Σπηλιωτακάρας, Αθανάσιος. "Διαχείριση κρυφής μνήμης επεξεργαστών με πρόβλεψη". Thesis, 2010. http://nemertes.lis.upatras.gr/jspui/handle/10889/3000.

Full text
Abstract:
Στον διαρκώς μεταβαλλόμενο τομέα της αρχιτεκτονικής των υπολογιστών, τα τελευταία 30 τουλάχιστον χρόνια οι αλλαγές έρχονται με εκθετικό ρυθμό. Οι κρυφές μνήμες αποτελούν πλέον το κέντρο του ενδιαφέροντος, αφού οι επεξεργαστές γίνονται ολοένα και ταχύτεροι, ολοένα και αποδοτικότεροι, αλλά τα κυκλώματα μνήμης αδυνατούν να τους ακολουθήσουν. Το επιστημονικό αυτό πεδίο στρέφεται πλέον σε έξυπνες λύσεις που έχουν ως στόχο την μείωση του κόστους επικοινωνίας μεταξύ των δύο υποσυστημάτων. Οι τρόποι διαχείρισης της κρυφής μνήμης αποτελούν έκφανση της πραγματικότητας αυτής και ένα από τα βασικότερα μέ
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Cache replacement algorithms"

1

Aziz, Nazrina, Syariza Abdul-Rahman, and Norhaslina Zainal Abidin, eds. Recent Applications in Quantitative Methods and Information Technology. UUM Press, 2019. http://dx.doi.org/10.32890/9789672210269.

Full text
Abstract:
This book is a guide for researchers who are involved in statistical, mathematical, information technology and decision science analyses. The purpose of the book is to allow readers to get research ideas on a wide range of topics, such as sampling plans, capital budgeting, completion time in production line, searching pattern for mobile cache replacement policy, home security system with biometric finger print and web service technology. The analyses in each chapter are explained in detail with samples of real applications in daily life to assist readers to appreciate theoretical, algorithm an
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Cache replacement algorithms"

1

Cohen, Edith, Balachander Krishnamurthy, and Jennifer Rexford. "Evaluating Server-Assisted Cache Replacement in the Web." In Algorithms — ESA’ 98. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-68530-8_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vakali, A. I. "LRU-based algorithms for Web Cache Replacement." In Electronic Commerce and Web Technologies. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44463-7_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lu, HuaCheng, Yong Wang, JunQi Chen, DaHuan Zhang, and ZhiKe Li. "TDC: Pool-Level Object Cache Replacement Algorithm Based on Temperature Density." In Algorithms and Architectures for Parallel Processing. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-0834-5_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kang, Yong-Kyoon, Ki-Chang Kim, and Yoo-Sung Kim. "Probability-Based Tile Pre-fetching and Cache Replacement Algorithms for Web Geographical Information Systems." In Advances in Databases and Information Systems. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44803-9_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ghandeharizadeh, Shahram, Sandy Irani, and Jenny Lam. "Cache Replacement with Memory Allocation." In 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973754.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Jianmin, Bo Zhang, and Fuzong Lin. "A New Cache Replacement Algorithm in SMO." In Pattern Recognition with Support Vector Machines. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45665-1_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhou, Shuchang. "An Efficient Simulation Algorithm for Cache of Random Replacement Policy." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15672-4_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Haraty, Ramzi A., and Lama Hasan Nahas. "A Recommended Replacement Algorithm for the Scalable Asynchronous Cache Consistency Scheme." In IT Convergence and Security 2017. Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-6451-7_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Dong, Linpeng Huang, and Minglu Li. "LFC-K Cache Replacement Algorithm for Grid Index Information Service (GIIS)." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30208-7_107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sasabe, Masahiro, Naoki Wakamiya, Masayuki Murata, and Hideo Miyahara. "Media Streaming on P2P Networks with Bio-inspired Cache Replacement Algorithm." In Biologically Inspired Approaches to Advanced Information Technology. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27835-1_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Cache replacement algorithms"

1

Saxena, Rakesh Kumar, Sunil Gupta, Kamal Saluja, Ashish K. Sharma, Aman Kumar, and D. P. Gupta. "Implementation of Web Cache Replacement Algorithm for E-commerce." In 2025 4th OPJU International Technology Conference (OTCON) on Smart Computing for Innovation and Advancement in Industry 5.0. IEEE, 2025. https://doi.org/10.1109/otcon65728.2025.11071062.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, Ming-Chang, Fang-Yie Leu, and Ying-Ping Chen. "Cache Replacement Algorithms for YouTube." In 2014 IEEE 28th International Conference on Advanced Information Networking and Applications (AINA). IEEE, 2014. http://dx.doi.org/10.1109/aina.2014.91.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Souza, Matheus, Henrique Cota Freitas, and Frédéric Pétrot. "Coherence State Awareness in Way-Replacement Algorithms for Multicore Processors." In XX Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2019. http://dx.doi.org/10.5753/wscad.2019.8672.

Full text
Abstract:
Due to their performance impact on program execution, cache replacement policies in set-associative caches have been studied in great depth. Currently, most general-purpose processors are multi-core, and among the very large corpus of research, and much to our surprise, we could not find any replacement policy that does actually take into account information relative to the sharing state of a cache way. Therefore, in this paper we propose to add, as a complement to the classical time-based related way-selection algorithms, an information relative to the sharing state and number of sharers of t
APA, Harvard, Vancouver, ISO, and other styles
4

Mahara, Arpan, Jose Fuentes, Christian Poellabauer, and Naphtali D. Rishe. "STRCacheML: A Machine Learning-Assisted Content Caching Policy for Streaming Services." In 5th International Conference on Artificial Intelligence and Big Data. Academy & Industry Research Collaboration Center, 2024. http://dx.doi.org/10.5121/csit.2024.140409.

Full text
Abstract:
Content caching is vital for enhancing web server efficiency and reducing network congestion, particularly in platforms predicting user actions. Despite many studies conducted toimprove cache replacement strategies, there remains space for improvement. This paper introduces STRCacheML, a Machine Learning (ML) assisted Content Caching Policy. STRCacheML leverages available attributes within a platform to make intelligent cache replacement decisions offline. We have tested various Machine Learning and Deep Learning algorithms to adapt the one with the highest accuracy; we have integrated that al
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Yun. "Application of Machine Learning Algorithm in Cache Replacement Strategy." In 2021 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP). IEEE, 2021. http://dx.doi.org/10.1109/paap54281.2021.9720449.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kedzierski, Kamil, Miquel Moreto, Francisco J. Cazorla, and Mateo Valero. "Adapting cache partitioning algorithms to pseudo-LRU replacement policies." In 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS). IEEE, 2010. http://dx.doi.org/10.1109/ipdps.2010.5470352.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sheikh, Rami, and Mazen Kharbutli. "Improving cache performance by combining cost-sensitivity and locality principles in cache replacement algorithms." In 2010 IEEE International Conference on Computer Design (ICCD 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccd.2010.5647594.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sheu, Jang-Ping, Po-Yao Wang, and RB Jagadeesha. "Wildcard-rule caching and cache replacement algorithms in Software-Defined Networking." In 2017 European Conference on Networks and Communications (EuCNC). IEEE, 2017. http://dx.doi.org/10.1109/eucnc.2017.7980654.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

"ANALYSIS OF WEB-PROXY CACHE REPLACEMENT ALGORITHMS UNDER STEADY-STATE CONDITIONS." In 3rd International Conference on Web Information Systems and Technologies. SciTePress - Science and and Technology Publications, 2007. http://dx.doi.org/10.5220/0001285702530260.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Keqiu, Wenyu Qu, Hong Shen, Di Wu, and Takashi Nanya. "Two Cache Replacement Algorithms Based on Association Rules and Markov Models." In 2005 First International Conference on Semantics, Knowledge and Grid. IEEE, 2005. http://dx.doi.org/10.1109/skg.2005.136.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Cache replacement algorithms' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography