Tagged-Data Prediction for Streaming-Write Cache Scheduling

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing cache systems face inefficiencies in handling streaming-write requests due to the complexity introduced by memory safety check tags, which require additional access scheduling steps, and determining the status of cache data entries as tagged or untagged can be time-consuming, leading to delays in processing.

Innovation Solution

Implementing tagged-data prediction circuitry to generate predictions about whether a cache data entry is tagged or untagged, allowing for speculative access scheduling based on these predictions, reducing the need for time-consuming status checks and optimizing cache access for streaming-write requests.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If memory safety check tags are implemented in cache systems, then memory safety is improved, but cache access complexity and processing time increase

Engineering Contradiction:
Improvememory safetyVSAvoidcache access complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by determining whether a cache data entry is tagged or untagged before processing the streaming-write request. The system performs this status determination in advance, allowing it to select the appropriate access schedule (first schedule for tagged entries, second schedule for untagged entries) before the actual write operation begins. This resolves the contradiction by preparing the cache access path beforehand, reducing the complexity impact during actual memory safety check operations.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent implements dynamics by making the cache access schedule adaptive based on the determined status of the cache data entry. The system dynamically selects between at least two different access schedules depending on whether the entry is tagged or untagged. This dynamic adaptation allows the cache system to optimize its behavior for each specific case, managing the complexity introduced by memory safety check tags through flexible, status-dependent access patterns.

Inventive Principle:
Principle #15Dynamics

2Reliability

If cache data entry status determination is performed before streaming-write, then memory safety is ensured, but processing delay increases

Engineering Contradiction:
Improvememory safety checkVSAvoidprocessing delay
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent applies preliminary action by determining the status of cache data entries in advance, before the streaming-write request is fully processed. This status determination is performed as a preliminary step that enables subsequent optimization of the access schedule. By resolving the status question beforehand, the system ensures memory safety checks are completed early, reducing the time penalty impact during the actual write operation.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system dynamically adjusts the access schedule based on the determined status, which allows it to minimize processing delays. When untagged entries are detected, the system can use a more efficient second access schedule that avoids unnecessary safety check overhead. This dynamic scheduling resolves the contradiction by adapting the processing path to the actual data state, ensuring safety where needed while minimizing delays when possible.

Inventive Principle:
Principle #15Dynamics

3Productivity

If speculative access scheduling is implemented, then cache access performance is improved, but prediction accuracy requirements increase system complexity

Engineering Contradiction:
Improvecache access performanceVSAvoidprediction mechanism complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent applies preliminary action through speculative access scheduling, where the system determines cache data entry status and selects access schedules before the actual write operation completes. This preliminary determination allows the cache system to prepare the optimal access path in advance, improving overall access performance. The prediction mechanism, while adding some complexity, enables this look-ahead optimization that resolves the contradiction by preparing schedules speculatively based on current cache state information.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS12443529B2Tagged-data prediction
Publication Date: 2025.10.14 ARM LTD
  • US12443529B2 patent drawing
  • US12443529B2 patent drawing
  • US12443529B2 patent drawing

AI summary

An apparatus has cache data storage, and tagged-data prediction circuitry to generate a tagged-data prediction in response to a streaming-write request requesting that write data corresponding to a target address which missed in a previous level of cache is written to the cache data storage for the given level of cache without being allocated into the previous level of cache. The tagged-data prediction is indicative of whether a target cache data entry corresponding to the target address of the streaming-write request is predicted to be a tagged cache data entry that stores cached data associated with the target address and a valid memory safety check tag corresponding to the target address, or an untagged cache data entry that stores the cached data but does not store a valid memory safety check tag. Cache access scheduling circuitry selects, based on the tagged-data prediction generated by the tagged-data prediction circuitry for the streaming-write request, how to schedule access to the cache data storage in response to the streaming-write request.