20092009 IEEE Youth Conference on Information, Computing and TelecommunicationRequires access

A novel cache mapping scheme for dynamic set-based cache partitioning

Tsung Lee, Hsiang-Hua Tsou

Open publisher page 4 citations

Abstract

In this research, we designed a novel cache mapping scheme for dynamic set-based cache partitioning. The cache mapping scheme facilitates allocation of any non-power-of-2 number of physical cache segments as a private cache to each process. An efficient near-optimal cache partitioning algorithm was designed for capturing working sets of running processes. Transparent cache reconfiguration was designed to enable immediately continuing process execution after cache repartitioning is computed. Experimental results validate its effectiveness in improving the overall hit ratio, the total number of memory accesses, and overall program performance with small number of communications.

About this research paper

What this paper is about

In this research, we designed a novel cache mapping scheme for dynamic set-based cache partitioning. The cache mapping scheme facilitates allocation of any non-power-of-2 number of physical cache segments as a private cache to each process. An efficient near-optimal cache partitioning algorithm was designed for capturing working sets of running processes. Transparent cache reconfiguration was designed to enable immediately continuing process execution after cache repartitioning is computed. Experimental results validate its effectiveness in improving the overall hit ratio, the total number of memory accesses, and overall program performance with small number of communications.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this research, we designed a novel cache mapping scheme for dynamic set-based cache partitioning. The cache mapping scheme facilitates allocation of any non-power-of-2 number of physical cache segments as a private cache to each process. An efficient near-optimal cache partitioning algorithm was designed for capturing working sets of running processes. Transparent cache reconfiguration was designed to enable immediately continuing process execution after cache repartitioning is computed. Experimental results validate its effectiveness in improving the overall hit ratio, the total number of memory accesses, and overall program performance with small number of communications.

Key concepts: Cache, Cache algorithms, Cache invalidation, Cache coloring, Computer science, Cache pollution, Smart Cache, Cache-oblivious algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
A novel cache mapping scheme for dynamic set-based cache partitioning — Research Paper | ScholarLens