Zobrazeno 1 - 10
of 19 611
pro vyhledávání: '"cache miss"'
The cache plays a key role in determining the performance of applications, no matter for sequential or concurrent programs on homogeneous and heterogeneous architecture. Fixing cache misses requires to understand the origin and the type of cache miss
Externí odkaz:
http://arxiv.org/abs/2203.08943
Autor:
Cole, Richard, Ramachandran, Vijaya
We analyze the caching overhead incurred by a class of multithreaded algorithms when scheduled by an arbitrary scheduler. We obtain bounds that match or improve upon the well-known $O(Q+S \cdot (M/B))$ caching cost for the randomized work stealing (R
Externí odkaz:
http://arxiv.org/abs/1705.08350
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The aim of the paper is to evaluate the miss probability of a Least Recently Used (LRU) cache, when it is offered a non-stationary request process given by a Poisson cluster point process. First, we construct a probability space using Palm theory, de
Externí odkaz:
http://arxiv.org/abs/1511.07392
Autor:
Hussein, Salam Ayad1 salamayad.77@uomustansiriyah.edu.iq, Kareem, Mohsin Raad2, George, Dena Nader1
Publikováno v:
Ingénierie des Systèmes d'Information. Apr2024, Vol. 29 Issue 2, p697-703. 7p.
Autor:
Rutar, Nick, Hollingsworth, Jeffrey K.
Publikováno v:
In Parallel Computing March 2013 39(3):120-131
Publikováno v:
ACM Transactions on Architecture and Code Optimization. 20:1-28
For Affine Control Programs or Static Control Programs (SCoP), symbolic counting of reuse distances could induce polynomials for each reuse pair. These polynomials along with cache capacity constraints lead to non-affine (semi-algebraic) sets; and co
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
V. A. Egunov, V. A. Shabalovsky
Publikováno v:
Вестник Дагестанского государственного технического университета: Технические науки, Vol 51, Iss 3, Pp 60-71 (2024)
Objective. The study presented in the paper is aimed at studying the methods for improving the efficiency of software in modern computing systems with a hierarchical memory structure. Method. The study is based on data caching technologies in micropr
Externí odkaz:
https://doaj.org/article/1039efdd20464221aafc1971ffe9691e
Publikováno v:
ICPADS
To mitigate the ever worsening "Power wall" and "Memory wall" problems, multi-core architectures with multi-level cache hierarchies have been widely used in modern processors. However, data sharing caused by the concurrent threads running on differen