Results 1 to 10 of about 24,906 (235)
A Heterogeneity-Aware Replacement Policy for the Partitioned Cache on Asymmetric Multi-Core Architectures [PDF]
Micromachines, 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 +4 more sources
Contextual dimensions for cache replacement schemes in information-centric networks: a systematic review [PDF]
PeerJ 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
LR-LRU: A PACS-Oriented Intelligent Cache Replacement Policy
IEEE Access, 2019 An intelligent cache replacement policy suitable for picture archiving and communication systems (PACS) was proposed in this work. By combining the logistic regression (LR) algorithm with the classic least recently used (LRU) cache replacement policy, we
Yinyin Wang +5 more
doaj +3 more sources
A cache replacement policy to reduce cache miss rate for multiprocessor architecture
IEICE Electronics Express, 2010 In this paper, a new cache replacement policy named Selection Alternative Replacement (SAR), which minimizes shared cache miss rate in chip multi-processor architecture, is proposed. A variety of cache replacement policies have been used for minimizing the cache misses.
Ho Lim, Jaehwan Kim, Jong-Wha Chong
exaly +3 more sources
IEEE 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
Sensitivity of cache replacement policies [PDF]
ACM Transactions 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 0001, Daniel Grund
openaire +1 more source
IMU: A Content Replacement Policy for CCN, Based on Immature Content Selection
Applied Sciences, 2021 In-network caching is the essential part of Content-Centric Networking (CCN). The main aim of a CCN caching module is data distribution within the network. Each CCN node can cache content according to its placement policy. Therefore, it is fully equipped
Salman Rashid +2 more
doaj +1 more source
Learning Future Reference Patterns for Efficient Cache Replacement Decisions
IEEE Access, 2022 This study proposes a cache replacement policy technique to increase the cache hit rate. This policy can improve the efficiency of cache management and performance.
Hyejeong Choi, Sejin Park
doaj +1 more source
Estimating the Performance of Cache Replacement Policies [PDF]
2008 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design, 2008 Caches are commonly employed to hide the latency gap between memory and the CPU by exploiting locality in memory accesses. The cache performance strongly influences a system's overall performance, as this gap is large and ever-increasing. The efficiency of a given cache architecture - usually measured by its miss ratio - varies greatly depending on the
Grund D., Reineke J.
openaire +1 more source
IEEE Access, 2023 The cache replacement policy (CRP) can reduce cache redundancy, improve cache usefulness, and increase network efficiency in content-centric networks (CCN). The essential challenges in addressing CRP in (CCN) evaluation involve significant fuzziness.
Muhammad Ali Khan +2 more
doaj +1 more source