Results 11 to 20 of about 88,406 (306)
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
Jurkiewicz, Tomasz +2 more
core +3 more sources
Access-Time-Aware Cache Algorithms [PDF]
ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2016 Most of the caching algorithms are oblivious to requests’ timescale, but caching systems are capacity constrained and, in practical cases, the hit rate may be limited by the cache’s impossibility to serve requests fast enough. In particular, the hard-disk access time can be the key factor capping cache performance.
Neglia, Giovanni +5 more
openaire +9 more sources
The Cache Complexity of Multithreaded Cache Oblivious Algorithms [PDF]
Theory of Computing Systems, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frigo, Matteo, Strumpen, Volker
openaire +2 more sources
Cache Optimization Models and Algorithms [PDF]
Foundations and Trends® in Communications and Information Theory, 2020 127 pages, 46 ...
Paschos, Georgios +2 more
openaire +4 more sources
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
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints [PDF]
, 2017 We consider caching in cellular networks in which each base station is equipped with a cache that can store a limited number of files. The popularity of the files is known and the goal is to place files in the caches such that the probability that a user
Avrachenkov, Konstantin +2 more
core +12 more sources
, 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
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