Circular Storage Queue Commit Tracking for Correct Data Reads
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In operating systems using circular storage queues, out-of-order commit operations lead to incorrect data reading and reduce system efficiency due to threads needing to wait for each other's commit operations to complete.
Innovation Solution
Implementing a first write identifier to determine the commit status of storage areas, allowing out-of-order commit without affecting data correctness by ensuring the size of stored data matches allocated space, thereby enabling threads to proceed without waiting.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If threads perform in-order commit operations in a circular storage queue, then data reading correctness is maintained, but system running efficiency deteriorates due to threads needing to wait for each other's commit operations
Solution Approach 1:
The patent introduces a write identifier parameter for each storage area to track the commit status. By changing the state tracking mechanism from sequential thread-based waiting to identifier-based status checking, the system allows out-of-order commit operations while maintaining data correctness through the write identifier verification
2Productivity
If threads perform out-of-order commit operations, then system running efficiency improves by eliminating waiting periods, but data reading correctness deteriorates due to potential premature reads
Solution Approach 1:
The patent implements a feedback mechanism where the read thread checks the write identifier of the current storage area against the expected commit status. This feedback loop ensures that reads only occur when the storage area is fully committed, preventing premature reads while allowing out-of-order commit operations to proceed
Solution Approach 2:
The system performs preliminary checks of the write identifier before allowing data reads. By verifying the commit status in advance through the write identifier, the system ensures data correctness is maintained while enabling threads to proceed with out-of-order commit operations without waiting
Data Source
AI summary
This application relates to data processing methods and devices. An example method includes obtaining a first global read pointer of a circular storage queue, where the circular storage queue includes a plurality of storage areas, and the first global read pointer points to a first storage area in the plurality of storage areas. The method further includes obtaining a first write identifier of the first storage area, where the first write identifier indicates a size of space of stored data in the first storage area. The method further includes in response to determining that the size of the space of the stored data in the first storage area is equal to the size of the allocated space in the first storage area, reading first data in a first sub-area.