Storage Hierarchy Transaction Delegation to Prevent Queue Saturation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing storage hierarchies face issues with transaction request saturation in faster storage structures, leading to reduced throughput and increased latency due to the need to track a large number of outstanding requests, which can result in the slower storage structures being overwhelmed.
Innovation Solution
A storage hierarchy is implemented with a first storage structure that delegates the tracking and fulfillment of transaction requests to a second storage structure when the lookup misses, reducing the load on the first storage structure's transaction queue and allowing it to focus on more urgent requests.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the first storage structure tracks all outstanding transaction requests in its transaction queue, then the fulfilment of transaction requests can be monitored, but the transaction queue becomes saturated leading to reduced throughput and increased latency
Solution Approach 1:
The patent segments the transaction tracking function by dividing the transaction queue into two parts: (1) a first transaction queue in the first storage structure for tracking only critical outstanding requests, and (2) a second transaction queue in the second storage structure for tracking additional outstanding requests. This segmentation allows the first storage structure to maintain reliable tracking of essential transactions while avoiding queue saturation, thereby preserving throughput.
Solution Approach 2:
The patent extracts the function of tracking certain transaction requests from the first storage structure's transaction queue and relocates it to the second storage structure's transaction queue. Specifically, when a lookup misses in the first storage structure, the resulting transaction request is tracked in the second storage structure instead of the first. This extraction reduces the load on the first transaction queue, preventing saturation and maintaining high throughput while still ensuring reliable tracking of all outstanding requests across the hierarchy.
2Reliability
If the first storage structure tracks a large number of outstanding transaction requests, then comprehensive monitoring is achieved, but latency increases due to queue management overhead
Solution Approach 1:
By segmenting transaction tracking across two storage structures, the patent reduces the number of requests the first storage structure must monitor simultaneously. The first transaction queue handles only essential tracking, while the second transaction queue manages additional requests. This segmentation reduces queue management overhead in the first storage structure, thereby reducing latency while maintaining comprehensive monitoring capability across the entire hierarchy.
Solution Approach 2:
The second storage structure acts as an intermediary for tracking certain transaction requests. When the first storage structure issues a transaction request to the second storage structure, the second structure assumes responsibility for tracking that request's fulfilment. This intermediary role reduces the tracking burden on the first storage structure, minimizing its overhead and associated latency while ensuring that all outstanding requests are still monitored through the coordinated operation of both structures.
3Reliability
If the first storage structure maintains all transaction information, then complete transaction state is preserved, but the storage structure becomes overwhelmed reducing efficiency
Solution Approach 1:
The patent segments transaction information storage across two storage structures. The first storage structure maintains transaction state information for requests it directly manages, while the second storage structure maintains information for requests it tracks. This segmentation distributes the information storage burden, preventing the first storage structure from becoming overwhelmed while preserving complete transaction state information across the combined system, thereby maintaining processing efficiency.
Solution Approach 2:
The patent extracts certain transaction state information maintenance from the first storage structure and assigns it to the second storage structure. When a lookup misses in the first storage structure, the resulting transaction request's state information is maintained in the second storage structure's transaction queue rather than the first. This extraction reduces the information storage load on the first storage structure, preventing it from becoming overwhelmed and maintaining high processing efficiency while ensuring complete transaction state is preserved through coordination between both structures.
Data Source
AI summary
There is provided an apparatus, a method, a system, a chip containing product, and a medium. The apparatus comprises a first storage structure to store a first set of data items, the first storage structure comprising a first transaction queue to store first transaction data to track fulfilment of outstanding first transaction requests. The apparatus is also provided with a second storage structure. The first storage structure is responsive to a received request for a given data item, to issue a first transaction request for the given data item to the second storage structure, and for a stage of fulfilment of the first transaction request, to omit storage of information relating to the first transaction request in the first transaction queue and to delegate the maintenance of at least some information relating to the stage of fulfilment of the first transaction request to the second storage structure.