286 search results - page 22 / 58 » Cache Remapping to Improve the Performance of Tiled Algorith... |
JSAC
2007
13 years 8 months ago
2007
— In a mobile cooperative caching environment, we observe the need for cooperating peers to cache useful data items together, so as to improve cache hit from peers. This could be...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
AAECC
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
ICCD
2005
IEEE
14 years 5 months ago
2005
IEEE
Recent studies have shown that in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large,...
SAINT
2003
IEEE
14 years 1 months ago
2003
IEEE
Caching frequently accessed data items on the client side is an effective technique to improve the system performance in wireless networks. Due to cache size limitations, cache re...