Results 31 to 40 of about 24,781 (241)
ADAPTIVE CACHE REPLACEMENT POLICY (ACRP): A DYNAMIC REPLACEMENT POLICY FOR CACHE MANAGEMENT
International Journal of New Computer Architectures and their Applications, 2014 The discovery of memory access time as one of the major design issues in the processor has increased effort in the development of different cache replacement policies to manage what to be the content of caches in both uniprocessor and multiprocessor. This is to improve the overall performance of the processor.
openaire +1 more source
Системный анализ и прикладная информатика, 2019 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.
A. A. Prihozhy
doaj +1 more source
Replacement policies for a proxy cache
IEEE/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
RIZZO, LUIGI, VICISANO LORENZO
openaire +2 more sources
Energy-Efficient Shared Cache Using Way Prediction Based on Way Access Dominance Detection
IEEE Access, 2021 To meet the performance demands of chip multiprocessors, chip designers have increased the capacity and hierarchy of cache memories. Accordingly, a shared lower-level cache reduces conflict misses by adopting a multi-way set-associative structure with ...
Yun-Seok Oh, Eui-Young Chung
doaj +1 more source
LRC: Dependency-Aware Cache Management for Data Analytics Clusters
, 2017 Memory caches are being aggressively used in today's data-parallel systems such as Spark, Tez, and Piccolo. However, prevalent systems employ rather simple cache management policies--notably the Least Recently Used (LRU) policy--that are oblivious to the
Letaief, Khaled Ben +3 more
core +2 more sources
Randomized cache placement for eliminating conflicts [PDF]
, 1999 Applications with regular patterns of memory access can experience high levels of cache conflict misses. In shared-memory multiprocessors conflict misses can be increased significantly by the data transpositions required for parallelization.
González Colás, Antonio María +1 more
core +2 more sources
Hardware-Based Implementation of Algorithms for Data Replacement in Cache Memory of Processor Cores
ComputersReplacement policies have an important role in the functioning of the cache memory of processor cores. The implementation of a successful policy allows us to increase the performance of the processor core and the computer system as a whole.
Larysa Titarenko +4 more
doaj +1 more source
An Efficient Cache Strategy in Information Centric Networking Vehicle-to-Vehicle Scenario
IEEE Access, 2017 Information centric networking (ICN) has been recently proposed as a prominent solution for content delivery in vehicular ad hoc networks. By caching the data packets in vehicular unused storage space, vehicles can obtain the replicate of contents from ...
Weicheng Zhao +4 more
doaj +1 more source
Adapting ACME to the database caching environment : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Information Systems at Massey University [PDF]
, 2003 The field of database cache replacement has seen a great many replacement policies presented in the past few years. As the challenge to find the optimal replacement policy continues, new methods and techniques of determining cache victims have been ...
Riaz-ud-Din, Faizal
core
Optimal Hierarchical Layouts for Cache-Oblivious Search Trees
, 2013 This paper proposes a general framework for generating cache-oblivious layouts for binary search trees. A cache-oblivious layout attempts to minimize cache misses on any hierarchical memory, independent of the number of memory levels and attributes at ...
Lindstrom, Peter, Rajan, Deepak
core +1 more source