Results 11 to 20 of about 86,694 (238)
Cache-Oblivious VAT-Algorithms [PDF]
, 2014 The VAT-model (virtual address translation model) extends the EM-model (external memory model) and takes the cost of address translation in virtual memories into account. In this model, the cost of a single memory access may be logarithmic in the largest address used.
Jurkiewicz, T. +2 more
openaire +4 more sources
Decision Tree-Based Adaptive Reconfigurable Cache Scheme
Algorithms, 2021 Applications have different preferences for caches, sometimes even within the different running phases. Caches with fixed parameters may compromise the performance of a system.
Wei Zhu, Xiaoyang Zeng
doaj +1 more source
Optimization of data allocation in hierarchical memory for blocked shortest paths algorithms
Системный анализ и прикладная информатика, 2021 This paper is devoted to the reduction of data transfer between the main memory and direct mapped cache for blocked shortest paths algorithms (BSPA), which represent data by a D[M×M] matrix of blocks.
A. A. Prihozhy
doaj +1 more source
Low depth cache-oblivious algorithms [PDF]
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures, 2010 In this paper we explore a simple and general approach for developing parallel algorithms that lead to good cache complexity on a variety of parallel cache architectures. The approach is to design nested parallel algorithms that have low depth (span, critical path length) and for which the natural sequential evaluation order has low cache complexity in
Blelloch, Guy E. +2 more
openaire +1 more source
Learning to Cache and Caching to Learn: Regret Analysis of Caching Algorithms [PDF]
IEEE/ACM Transactions on Networking, 2022 Crucial performance metrics of a caching algorithm include its ability to quickly and accurately learn a popularity distribution of requests. However, a majority of work on analytical performance analysis focuses on hit probability after an asymptotically large time has elapsed. We consider an online learning viewpoint, and characterize the "regret" in
Archana Bura +4 more
openaire +2 more sources
AUTOMATON MODEL, DEVICE SYNTHESIS AND ADAPTIVE SUBSTITUTION ALGORITHM FOR CACHE MEMORY
Радіоелектронні і комп'ютерні системи, 2020 The probability indicators of the hits or misses events have conditioned the application of the certain substitution policies in the associative cache and the associative translation look-a-side buffer.
Вадим Олексійович Пуйденко
doaj +1 more source
Cache-Efficient Multigrid Algorithms [PDF]
The International Journal of High Performance Computing Applications, 2001 Multigrid is widely used as an efficient solver for sparse linear systems arising from the discretization of elliptic boundary value problems. Linear relaxation methods such as Gauss–Seidel and Red–Black Gauss–Seidel form the principal computational component of multigrid, and thus affect its efficiency.
Sriram Sellappa, Siddhartha Chatterjee
openaire +1 more source
, 2002 In the on-line file-caching problem problem, the input is a sequence of requests for files, given on-line (one at a time). Each file has a non-negative size and a non-negative retrieval cost.
Young, Neal E.
core +3 more sources
A Cache Placement Strategy Based on Entropy Weighting Method and TOPSIS in Named Data Networking
IEEE Access, 2021 Named data networking (NDN) aims to change the traditional content delivery method and caching by router nodes caching and participating in forwarding.
Yiqi Gui, Yongkang Chen
doaj +1 more source
IET Communications, EarlyView., 2022 Abstract The goal of this work is to investigate how the self‐awareness characteristic of autonomic computing, paired with existing performance optimization rules, may be used in applications to minimise multi‐core processor performance concerns. The suggested self‐awareness technique can assist applications in self‐execution while also assisting other
Surendra Kumar Shukla +8 more
wiley +1 more source