Results 1 to 10 of about 2,022 (254)

Contextual dimensions for cache replacement schemes in information-centric networks: a systematic review [PDF]

open access: yesPeerJ Computer Science, 2021
In recent years, information-centric networks (ICNs) have gained attention from the research and industry communities as an efficient and reliable content distribution network paradigm, especially to address content-centric and bandwidth-needed ...
Stéfani Pires   +2 more
doaj   +3 more sources

Sensitivity of Cache Replacement Policies [PDF]

open access: yesTransactions on Embedded Computing Systems, 2013
The sensitivity of a cache replacement policy expresses to what extent the execution history may influence the number of cache hits and misses during program execution. We present an algorithm to compute the sensitivity of a replacement policy.
Jan Reineke, Daniel Grund
exaly   +2 more sources

An Improved Web Cache Replacement Algorithm Based on Weighting and Cost

open access: yesIEEE Access, 2018
Cache memory plays an important role in improving the performance of web servers, especially for big data transmission, which response time is constrained. It is necessary to use an effective method, such as web cache.
Yuan Tian, Mznah Al-Rodhaan, Tinghuai Ma
exaly   +3 more sources

Advancements in cache management: a review of machine learning innovations for enhanced performance and security [PDF]

open access: yesFrontiers in Artificial Intelligence
Machine learning techniques have emerged as a promising tool for efficient cache management, helping optimize cache performance and fortify against security threats.
Keshav Krishna
doaj   +2 more sources

Replacement Policies for a Proxy Cache

open access: yesIEEE/ACM Transactions on Networking, 2000
In this paper, we analyze access traces to a Web proxy, looking at statistical parameters to be used in the design of a replacement policy for documents held in the cache. In the first part of this paper, we present a number of properties of the lifetime and statistics of access to documents, derived from two large trace sets coming from very different
Luigi Rizzo, L Vicisano
exaly   +3 more sources

Instruction Cache Replacement Policies and Organizations [PDF]

open access: yesIEEE Transactions on Computers, 1985
Instruction cache replacement policies and organizations are analyzed both theoretically and experimentally. Theoretical analyses are based on a new model for cache references —the loop model. First the loop model is used to study replacement policies and cache organizations.
James E. Smith 0001, James R. Goodman
exaly   +3 more sources

A Case for MLP-Aware Cache Replacement [PDF]

open access: yes33rd International Symposium on Computer Architecture (ISCA'06), 2006
Performance loss due to long-latency memory accesses can be reduced by servicing multiple memory accesses concurrently. The notion of generating and servicing long-latency cache misses in parallel is called Memory Level Parallelism (MLP). MLP is not uniform across cache misses - some misses occur in isolation while some occur in parallel with other ...
Y N Patt
exaly   +3 more sources

Research on Strong Cache Consistency Under Generic Cache Replacement Strategy [PDF]

open access: yesJisuanji gongcheng, 2022
Establishing an accurate cache analysis model helps to predict the cache behavior better, which is vital for network performance analysis and planning.However, existing analysis models for cache consistency studies are based on the Least Recently Used ...
YANG Tao, ZHENG Quan, XU Zhenghuan, SHI Qianbao, PENG Siwei
doaj   +1 more source

A Heterogeneity-Aware Replacement Policy for the Partitioned Cache on Asymmetric Multi-Core Architectures

open access: yesMicromachines, 2022
In an asymmetric multi-core architecture, multiple heterogeneous cores share the last-level cache (LLC). Due to the different memory access requirements among heterogeneous cores, the LLC competition is more intense.
Juan Fang   +4 more
doaj   +1 more source

RL-Based Cache Replacement: A Modern Interpretation of Belady’s Algorithm With Bypass Mechanism and Access Type Analysis

open access: yesIEEE Access, 2023
Belady’s algorithm is widely known as an optimal cache replacement policy. It has been the foundation of numerous recent studies on cache replacement policies, and most studies assume this as an upper limit.
Ho Jung Yoo, Jeong Hun Kim, Tae Hee Han
doaj   +1 more source

Home - About - Disclaimer - Privacy