GPU Queue Buffer for Low-Latency On-Die Data Retrieval

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current graphics processing units (GPUs) face limitations in maximizing on-die data retrieval efficiency due to the need for frequent access to off-chip memory, which can lead to increased latency and reduced performance.

Innovation Solution

The implementation of queues and transitional storage within the GPU architecture allows for temporary buffering of requests, utilizing nearby queues or buffers for lazy writes, thereby reducing the need for immediate off-chip memory access and enhancing on-die data handling capabilities.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If frequent access to off-chip memory is used, then data retrieval capability is maintained, but latency increases and performance decreases

Engineering Contradiction:
Improvedata retrieval capabilityVSAvoidlatency
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent introduces an intermediary storage structure (queue buffer) between the GPU core and off-chip memory. This queue buffer acts as a mediator that temporarily stores data requests and responses, allowing the GPU to access data through the queue buffer rather than directly accessing off-chip memory, thereby reducing latency while maintaining data retrieval capability.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent implements preliminary action by pre-loading data into the queue buffer before it is actually needed by the GPU core. The queue buffer proactively fetches data from off-chip memory and stores it in a readily accessible location, so when the GPU needs the data, it can retrieve it immediately without waiting for the slower off-chip memory access.

Inventive Principle:
Principle #10Preliminary action

2Productivity

If queues and transitional storage are implemented, then on-die data retrieval is improved, but device complexity increases

Engineering Contradiction:
Improveon-die data retrieval efficiencyVSAvoidGPU architecture complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent merges the queue buffer functionality with existing GPU architecture components, specifically integrating it into the memory controller or cache hierarchy. By combining the queue buffer with existing structures rather than adding completely separate components, the patent improves on-die data retrieval while minimizing the increase in overall device complexity.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The queue buffer is designed to serve multiple functions within the GPU architecture: it acts as a cache, a request queue, and a data buffer. This multi-functionality allows the same component to improve on-die data retrieval without requiring separate dedicated structures for each function, thereby limiting the increase in device complexity.

Inventive Principle:
Principle #6Universality (Multi-functionality)

3Speed

If additional cache memory is added, then bandwidth and latency are improved, but substrate space requirement increases

Engineering Contradiction:
Improvedata retrieval bandwidth and latencyVSAvoidsubstrate space
Core Design Contradiction:
SpeedVSArea of stationary object

Solution Approach 1:

The patent utilizes vertical stacking or three-dimensional integration to place the queue buffer in addition to existing layers rather than simply expanding horizontally. By exploiting the vertical dimension or utilizing existing three-dimensional space within the substrate, the patent adds cache memory capacity without proportionally increasing the substrate area.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Solution Approach 2:

The queue buffer is nested within or integrated with existing GPU substrate structures, such as being placed within existing memory controller regions or utilizing unused substrate areas. This nesting approach allows the cache memory to be embedded within the existing design footprint, improving performance without significantly increasing the overall substrate space requirement.

Inventive Principle:
Principle #7Nested doll (Nesting)

Data Source

PatentUS20240169466A1Systems and methods for exploiting queues and transitional storage for improved low-latency high-bandwidth on-die data retrieval
Publication Date: 2024.05.23 INTEL CORP
  • US20240169466A1 patent drawing
  • US20240169466A1 patent drawing
  • US20240169466A1 patent drawing

AI summary

Apparatuses including general-purpose graphics processing units and graphics multiprocessors that exploit queues or transitional buffers for improved low-latency high-bandwidth on-die data retrieval are disclosed. In one embodiment, a graphics multiprocessor includes at least one compute engine to provide a request, a queue or transitional buffer, and logic coupled to the queue or transitional buffer. The logic is configured to cause a request to be transferred to a queue or transitional buffer for temporary storage without processing the request and to determine whether the queue or transitional buffer has a predetermined amount of storage capacity.