Storage Device Queue Management via Dynamic Inhibition
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current storage devices face challenges in achieving improved operating speed due to limitations in managing submission and completion queues, leading to potential resource occupation and degradation in performance when completion queues become full.
Innovation Solution
The proposed solution involves an operating method for a storage device that includes selecting submission queues using round robin scheduling, inhibiting selection from full submission queues until they become normal, and adjusting weights to prioritize normal queues, along with performing background operations like garbage collection to manage full completion queues.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If round robin scheduling is used to select submission queues, then queue selection fairness is improved, but operating speed deteriorates when completion queues are full
Solution Approach 1:
The patent applies dynamics by making the queue selection process adaptive rather than static. The memory controller dynamically adjusts queue selection based on the full/not-full status of completion queues, switching from round-robin scheduling to priority-based selection without full queues, thereby optimizing operating speed while maintaining fairness when conditions permit
Solution Approach 2:
The patent changes the selection parameter from fixed round-robin indexing to dynamic queue status evaluation. By monitoring whether completion queues are full and adjusting selection behavior accordingly, the system transforms the selection criterion from a static algorithm to a state-dependent parameter, resolving the contradiction between fairness and speed
2Productivity
If submission queues are continuously selected regardless of completion queue status, then queue utilization is improved, but resource occupation increases leading to performance degradation
Solution Approach 1:
The patent implements feedback by continuously monitoring the status of completion queues (full or not full) and using this information to control submission queue selection. When completion queues are full, the system receives feedback to inhibit selection from corresponding submission queues, preventing resource occupation and performance degradation while maintaining optimal utilization when resources are available
Solution Approach 2:
The patent segments the queue management into independent controllable units where each submission queue can be individually inhibited or enabled based on its corresponding completion queue status. This segmentation allows selective resource allocation, preventing full queues from occupying system resources while maintaining utilization of available resources through normal queues
Data Source
AI summary
An operating method of a storage device including a nonvolatile memory and a memory controller configured to control the nonvolatile memory may include selecting one of a plurality of submission queues; fetching, from the selected submission queue, a command for accessing the storage device; executing the fetched command; outputting an execution result of the fetched command to a selected completion queue corresponding to the selected submission queue; determining whether a submission queue is a full submission queue, the full submission queue corresponding to a full completion queue; and inhibiting the selecting from selecting the full submission queue until the full completion queue becomes a normal completion queue, when the determining determines a submission queue is the full submission queue, wherein the plurality of submission queues are sequentially selected in accordance with round robin scheduling.