Cache Memory Controller Clean Block Replacement

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional cache block replacement algorithms do not consider the need to store modified blocks in the write buffer, leading to time delays and inefficient cache management, especially in systems with high CPU operation speed and increased memory access gaps.

Innovation Solution

A cache memory controller that monitors content modification status and replaces clean blocks when the write buffer reaches a certain level, ensuring efficient cache block replacement and reducing time delays by prioritizing clean blocks over dirty blocks.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If conventional LRU algorithm is used for cache block replacement, then the replacement decision is simple and fast, but time delay occurs when the block to be replaced is a dirty block that needs to be stored in the write buffer

Engineering Contradiction:
Improvecache block replacement speedVSAvoidtime delay due to write buffer full
Core Design Contradiction:
SpeedVSLoss of time

Solution Approach 1:

The patent segments the cache blocks into two categories: dirty blocks (modified) and clean blocks (unmodified). By monitoring the modification status of each block, the system can selectively replace clean blocks without incurring write buffer delays, thus resolving the contradiction between simple replacement and time delay

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary monitoring of block modification status before replacement decisions are made. By maintaining dirty bits that track whether blocks have been modified, the system proactively identifies clean blocks that can be replaced immediately without waiting for write buffer availability, eliminating time delay

Inventive Principle:
Principle #10Preliminary action

2Productivity

If dirty blocks are replaced according to LRU algorithm, then all replaceable blocks are treated equally, but the system performance deteriorates due to write buffer waits

Engineering Contradiction:
Improvesystem performanceVSAvoidwaiting time for write buffer
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent applies different replacement priorities to different types of cache blocks based on their modification status. Clean blocks are prioritized for immediate replacement, while dirty blocks are handled separately. This local differentiation in replacement quality eliminates unnecessary waiting time and improves overall system productivity

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS8930630B2Cache memory controller and method for replacing a cache block
Publication Date: 2015.01.06 IND ACAD COOP GRP OF SEJONG UNIV
  • US8930630B2 patent drawing
  • US8930630B2 patent drawing
  • US8930630B2 patent drawing

AI summary

The present disclosure relates to a cache memory controller for controlling a set-associative cache memory, in which two or more blocks are arranged in the same set, the cache memory controller including a content modification status monitoring unit for monitoring whether some of the blocks arranged in the same set of the cache memory have been modified in contents, and a cache block replacing unit for replacing a block, which has not been modified in contents, if some of the blocks arranged in the same set have been modified in contents.