Storage Page Dirty Data Indexing With Bitmaps or Extended Segments
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing storage systems face increased write data amounts and latency during synchronous operations due to whole-page writing, leading to degraded performance and reduced flash memory device lifespan.
Innovation Solution
A method and device for indexing dirty data using bitmaps or extended segments, determining the optimal indexing method based on storage and query costs to reduce write data and latency, and updating dirty data with smaller granularity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If whole-page writing is used to manage dirty data, then data consistency is ensured, but write data amount increases and flash memory device lifespan decreases
Solution Approach 1:
The patent segments the dirty data management at multiple levels: (1) divides storage pages into multiple storage points within a page, (2) further divides storage points into sub-storage points, and (3) introduces bitmap segments to track dirty data at each granularity level. This hierarchical segmentation allows writing only the actual dirty portions rather than entire pages, reducing write amplification and extending flash memory lifespan while maintaining data consistency through structured tracking.
2Reliability
If whole-page writing is used to manage dirty data, then data consistency is ensured, but flash memory device lifespan decreases
Solution Approach 1:
The patent implements hierarchical segmentation of storage pages into storage points and sub-storage points, with corresponding bitmap segments for tracking. This allows precise identification and writing of only the actual dirty data portions rather than entire pages, significantly reducing write amplification and extending flash memory device lifespan while maintaining data consistency through structured tracking at each granularity level.
Solution Approach 2:
The patent changes the granularity parameter of dirty data tracking from page-level to storage point-level and sub-storage point-level. By introducing bitmap segments that track dirty data at finer granularities, the system can dynamically determine the actual amount of dirty data and write only necessary portions, reducing wear on flash memory devices and extending their operational lifespan.
3Device complexity
If dirty data is tracked at page level, then system complexity is reduced, but write performance deteriorates
Solution Approach 1:
The patent segments the bitmap into multiple bitmap segments, each corresponding to specific storage points or sub-storage points within a page. This segmentation allows the system to track and write only the actual dirty portions at fine granularity, dramatically improving write performance by avoiding unnecessary writes of clean data while maintaining manageable complexity through the structured hierarchical organization of storage points and their corresponding bitmap segments.
4Loss of substance
If fine-granularity dirty data tracking is implemented, then write data amount is reduced, but system complexity increases
Solution Approach 1:
The patent implements hierarchical segmentation of storage pages into storage points and sub-storage points, with corresponding bitmap segments for tracking dirty data at each level. This structured segmentation enables fine-granularity tracking that reduces write data amount by precisely identifying dirty portions, while managing system complexity through the organized hierarchical structure where each segment has a clear correspondence to specific storage regions.
Solution Approach 2:
The patent performs preliminary actions by pre-dividing storage pages into storage points and sub-storage points with associated bitmap segments before actual writing operations. This preliminary structuring enables efficient tracking and identification of dirty data portions during write operations, reducing the need for complex real-time analysis while achieving fine-granularity tracking that minimizes write data amount.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method for indexing dirty data in a storage system page, includes: obtaining a point quantity of storage points in the storage page and dirty data distribution information; creating a bitmap based on the point quantity and the dirty data distribution information; creating an extended segment set based on the dirty data distribution information, and obtaining the number of current extended segments in the extended segment set; obtaining, according to the point quantity, a first storage cost for indexing dirty data using the bitmap in the target storage page; obtaining, according to the number of current extended segments and the segment capacity, a second storage cost for indexing dirty data using the extended segments in the target storage page; and determine, according to the first storage cost and the second storage cost, to index the dirty data in the target storage page by means of the bitmap or the extended segments.