Dynamic Memory Request Prioritization for Random Access Conflict Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for managing memory access requests are ineffective for complex applications like Fast Fourier Transforms and those with random or almost random memory access patterns, leading to frequent conflicts due to the unpredictability of memory access.
Innovation Solution
A data storage system with a clock signal input, multiple memories, input and output ports, and processing stages that prioritize requests based on a correspondence function to optimize memory access, selecting requests that align with the capacity of each memory and suspending new requests when conflicts arise, ensuring efficient handling of requests across clock cycles.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a correspondence function is used to manage memory access requests, then memory access efficiency is improved for predictable access patterns, but conflict frequency increases for unpredictable access patterns such as FFT and random access
Solution Approach 1:
The patent implements a dynamic request selection mechanism that adapts to different access patterns in real-time. The system monitors memory access requests and dynamically adjusts which requests are selected for processing in each clock cycle, rather than using a fixed correspondence function. This dynamic approach allows the system to handle both predictable and unpredictable access patterns effectively by making real-time decisions based on current memory capacity and request characteristics.
Solution Approach 2:
The system changes the parameter of request selection from a static correspondence function to a dynamic selection process that considers multiple factors including memory capacity, request priority, and access patterns. By changing how requests are mapped to memory ports based on current system state rather than fixed address mappings, the system reduces conflicts for unpredictable access patterns while maintaining efficiency for predictable ones.
2Productivity
If multiple access requests are received for the same memory in one clock cycle, then memory utilization increases, but conflict frequency increases beyond the memory's port capacity
Solution Approach 1:
The patent introduces an intermediary request selection mechanism between the input ports and memory units. This intermediary layer receives multiple access requests, evaluates them against current memory capacity and port availability, and selectively forwards requests to appropriate memory ports. This mediator prevents overload conflicts by ensuring that the number of requests forwarded to each memory does not exceed its port capacity, while still maximizing memory utilization across the system.
Solution Approach 2:
The system implements partial action by selectively processing only the necessary number of requests that match current memory capacity rather than forwarding all received requests. When memory ports are at capacity, the system partially processes the request stream by selecting only those requests that can be accommodated, preventing conflicts while maintaining high utilization of available memory resources.
3Ease of manufacture
If request selection is based on fixed correspondence function, then implementation simplicity is maintained, but adaptability to different access patterns decreases
Solution Approach 1:
The patent replaces the static correspondence function with a dynamic request selection mechanism that adapts to different access patterns. The system continuously monitors memory access characteristics and adjusts request selection accordingly, providing adaptability for both predictable patterns like sequential access and unpredictable patterns like random or FFT access, while maintaining reasonable implementation complexity through systematic selection criteria.
Data Source
Figure 1~2
AI summary
The method comprises, in a first clock cycle: - the obtaining (202) of new requests by the processing stage; - the provision (210) by the processing stage of at least one of the new requests; - the placing on standby (212) by the processing stage of at least one other of the new requests, hereinafter called the standby request. The method furthermore comprises, in a second clock cycle succeeding the first clock cycle: - the obtaining (202) by the processing stage of at least one new request; - the selecting (208) by the processing stage, from among the request or requests on standby and the new request or requests, of at least one request; - the provision (210) by the processing stage of the request or requests selected.