Name
Abstract | ||
|---|---|---|
Dynamic cache resizing mechanisms have been proposed to achieve both high performance and low energy consumption. The basic idea behind such mechanisms is to divide a cache into some parts, and manage them independently to resize the cache for resource allocation and energy saving. However, dynamic cache resizing mechanisms waste their resource to store a lot of dead-on-fill blocks, which are not reused after being stored in the cache. To reduce the number of dead-on-fill blocks in the cache and thus improve energy efficiency of dynamic cache resizing mechanisms, this paper proposes a dynamic LRU-K insertion policy. The policy stores a new coming block as the K-th least-recently-used one and adjusts K dynamically according to the application to be executed. Therefore, the policy can balance between early eviction of dead-on-fill blocks and retainment of reusable blocks. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1145/2212908.2212949 | Conf. Computing Frontiers |
Keywords | Field | DocType |
resource allocation,dead-on-fill block,basic idea,capacity-efficient insertion policy,dynamic cache,energy saving,k dynamically,dynamic lru-k insertion policy,policy store,low energy consumption,energy efficiency,least recently used,energy efficient | Cache-oblivious algorithm,Cache invalidation,Cache pollution,Computer science,Cache,Parallel computing,Page cache,Cache algorithms,Real-time computing,Cache coloring,Smart Cache | Conference |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masayuki Sato | 1 | 12 | 9.40 |
| Yusuke Tobo | 2 | 0 | 0.34 |
| Ryusuke Egawa | 3 | 109 | 28.68 |
| Hiroyuki Takizawa | 4 | 273 | 46.54 |
| Hiroaki Kobayashi | 5 | 76 | 18.02 |